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_38	Sandia/adder_dcop_39	Sandia/adder_dcop_40	Sandia/adder_dcop_41	Sandia/adder_dcop_42
Sandia/adder_dcop_43	Sandia/adder_dcop_44	Sandia/adder_dcop_45	Sandia/adder_dcop_46	Sandia/adder_dcop_47
Sandia/adder_dcop_48	Sandia/adder_dcop_49	Sandia/adder_dcop_50	Sandia/adder_dcop_51	Sandia/adder_dcop_52
Sandia/adder_dcop_53	Sandia/adder_dcop_54	Sandia/adder_dcop_55	Sandia/adder_dcop_56	Sandia/adder_dcop_57