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/can_256	HB/can_268	HB/can_292	HB/can_445	HB/can_61
HB/can_62	HB/can_634	HB/can_715	HB/can_73	HB/can_838
HB/can_96	HB/cegb2802	HB/cegb2919	HB/cegb3024	HB/cegb3306
HB/curtis54	HB/dwt_1005	HB/dwt_1007	HB/dwt_1242	HB/dwt_162