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.

Boeing/msc01440	Boeing/msc04515	Boeing/msc10848	Boeing/msc23052	Boeing/nasa1824
Boeing/nasa2910	Boeing/nasa4704	Boeing/pcrystk02	Boeing/pcrystk03	Boeing/pct20stif
Boeing/pwtk	Bomhof/circuit_1	Bomhof/circuit_2	Bomhof/circuit_3	Bomhof/circuit_4
Botonakis/FEM_3D_thermal1	Botonakis/FEM_3D_thermal2	Bova/rma10	Brethour/coater1	Brethour/coater2