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.

Mallya/lhr07c	Mallya/lhr10	Mallya/lhr10c	Mallya/lhr11	Mallya/lhr11c
Mallya/lhr14	Mallya/lhr14c	Mallya/lhr17	Mallya/lhr17c	Mallya/lhr34
Mallya/lhr34c	Mallya/lhr71	Mallya/lhr71c	Mancktelow/viscorocks	MathWorks/Harvard500
MathWorks/Kaufhold	MathWorks/Kuu	MathWorks/Muu	MathWorks/Pd	MathWorks/Pd_rhs