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/man_5976	HB/mbeacxc	HB/mbeaflw	HB/mbeause	HB/mcca
HB/mcfe	HB/nnc1374	HB/nnc261	HB/nnc666	HB/nos1
HB/nos2	HB/nos3	HB/nos4	HB/nos5	HB/nos6
HB/nos7	HB/orani678	HB/orsirr_1	HB/orsirr_2	HB/orsreg_1