A gallery of large graphs

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 1890 sparse matrices in this collection. Each of these sparse matrices (for rectangular matrix, an augmented matrix is formed first) 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 has 8863287 vertices and 44185251 edges. A simple coloring scheme is used: if the matrix has real entries, coloring is based on the entry value, otherwise it is based on the edge length.

Mittelmann/watson_2	MKS/fp	Morandini/robot	Morandini/rotor1	Morandini/rotor2
Muite/Chebyshev1	Muite/Chebyshev2	Muite/Chebyshev3	Muite/Chebyshev4	Mulvey/finan512
Mulvey/pfinan512	Nasa/barth	Nasa/barth4	Nasa/barth5	Nasa/nasa1824
Nasa/nasa2146	Nasa/nasa2910	Nasa/nasa4704	Nasa/nasasrb	Nasa/pwt