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.

Sandia/adder_dcop_18	Sandia/adder_dcop_19	Sandia/adder_dcop_20	Sandia/adder_dcop_21	Sandia/adder_dcop_22
Sandia/adder_dcop_23	Sandia/adder_dcop_24	Sandia/adder_dcop_25	Sandia/adder_dcop_26	Sandia/adder_dcop_27
Sandia/adder_dcop_28	Sandia/adder_dcop_29	Sandia/adder_dcop_30	Sandia/adder_dcop_31	Sandia/adder_dcop_32
Sandia/adder_dcop_33	Sandia/adder_dcop_34	Sandia/adder_dcop_35	Sandia/adder_dcop_36	Sandia/adder_dcop_37