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.

Pothen/mesh1em6	Pothen/mesh2e1	Pothen/mesh2em5	Pothen/mesh3e1	Pothen/mesh3em5
Pothen/onera_dual	Pothen/pwt	Pothen/shuttle_eddy	Pothen/skirt	Pothen/sphere2
Pothen/sphere3	Pothen/tandem_dual	Pothen/tandem_vtx	Qaplib/lp_nug05	Qaplib/lp_nug06
Qaplib/lp_nug07	Qaplib/lp_nug08	Qaplib/lp_nug12	Qaplib/lp_nug15	Qaplib/lp_nug20