A gallery of large graphs

graph drawing of matrices in the University of Florida Collection

Graph visualization is a way to discover and visualize structures in complex relations. What sort of structures are people who do large scale computation studying? We can get a glimpse by visualizing the thousands of sparse matrices submitted to the University of Florida Sparse Matrix collection. The resulting gallery contains the drawing of graphs as represented by 2272 sparse matrices in this collection. Each of these sparse matrices (a rectangular matrix is treated as a bipartite graph) is viewed as the adjacency matrix of an undirected graph, and is laid out by a multilevel graph drawing algorithm. If the graph is disconnected, then the largest connected component is drawn. The largest graph (Schenk@nlpkkt240) has 27,993,600 vertices and 366,327,376 edges. A simple coloring scheme is used: longer edges are colored with colder colors, and short ones warmer. The graphs are in alphabetical order. Use the "Search" link to find graphs of specific characters.

Prev 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 All Next Search

Pothen/mesh1em1	Pothen/mesh1em6	Pothen/mesh2e1	Pothen/mesh2em5	Pothen/mesh3e1
Pothen/mesh3em5	Pothen/onera_dual	Pothen/pwt	Pothen/shuttle_eddy	Pothen/skirt
Pothen/sphere2	Pothen/sphere3	Pothen/tandem_dual	Pothen/tandem_vtx	Priebel/130bit
Priebel/145bit	Priebel/162bit	Priebel/176bit	Priebel/192bit	Priebel/208bit