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.

PARSEC/Si34H36	PARSEC/Si41Ge41H72	PARSEC/Si5H12	PARSEC/Si87H76	PARSEC/SiH4
PARSEC/SiNa	PARSEC/SiO	PARSEC/SiO2	Pereyra/landmark	POLYFLOW/invextr1_new
POLYFLOW/mixtank_new	Pothen/barth	Pothen/barth4	Pothen/barth5	Pothen/bodyy4
Pothen/bodyy5	Pothen/bodyy6	Pothen/commanche_dual	Pothen/mesh1e1	Pothen/mesh1em1