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.

Gset/G24	Gset/G25	Gset/G26	Gset/G27	Gset/G28
Gset/G29	Gset/G3	Gset/G30	Gset/G31	Gset/G32
Gset/G33	Gset/G34	Gset/G35	Gset/G36	Gset/G37
Gset/G38	Gset/G39	Gset/G4	Gset/G40	Gset/G41