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/fs_760_3	HB/gemat1	HB/gemat11	HB/gemat12	HB/gent113
HB/gr_30_30	HB/gre_1107	HB/gre_115	HB/gre_185	HB/gre_216a
HB/gre_216b	HB/gre_343	HB/gre_512	HB/hor_131	HB/ibm32
HB/illc1033	HB/illc1850	HB/impcol_a	HB/impcol_b	HB/impcol_c