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/lnsp_511	HB/lock1074	HB/lock2232	HB/lock3491	HB/lock_700
HB/lshp1009	HB/lshp1270	HB/lshp1561	HB/lshp1882	HB/lshp2233
HB/lshp2614	HB/lshp_265	HB/lshp3025	HB/lshp3466	HB/lshp_406
HB/lshp_577	HB/lshp_778	HB/lund_a	HB/lund_b	HB/mahindas