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.

GHS_indef/helm3d01	GHS_indef/k1_san	GHS_indef/laser	GHS_indef/linverse	GHS_indef/mario001
GHS_indef/mario002	GHS_indef/ncvxbqp1	GHS_indef/ncvxqp1	GHS_indef/ncvxqp3	GHS_indef/ncvxqp5
GHS_indef/ncvxqp7	GHS_indef/ncvxqp9	GHS_indef/olesnik0	GHS_indef/qpband	GHS_indef/sit100
GHS_indef/sparsine	GHS_indef/spmsrtls	GHS_indef/stokes128	GHS_indef/stokes64	GHS_indef/stokes64s