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/bcsstm03	HB/bcsstm04	HB/bcsstm05	HB/bcsstm06	HB/bcsstm07
HB/bcsstm08	HB/bcsstm09	HB/bcsstm10	HB/bcsstm11	HB/bcsstm12
HB/bcsstm13	HB/bcsstm19	HB/bcsstm20	HB/bcsstm21	HB/bcsstm22
HB/bcsstm23	HB/bcsstm24	HB/bcsstm25	HB/bcsstm26	HB/bcsstm27