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.

HB/shl_200	HB/shl_400	HB/sstmodel	HB/steam1	HB/steam2
HB/steam3	HB/str_0	HB/str_200	HB/str_400	HB/str_600
HB/watt_1	HB/watt_2	HB/well1033	HB/well1850	HB/west0067
HB/west0132	HB/west0156	HB/west0167	HB/west0381	HB/west0479