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/oscil_dcop_24	Sandia/oscil_dcop_25	Sandia/oscil_dcop_26	Sandia/oscil_dcop_27	Sandia/oscil_dcop_28
Sandia/oscil_dcop_29	Sandia/oscil_dcop_30	Sandia/oscil_dcop_31	Sandia/oscil_dcop_32	Sandia/oscil_dcop_33
Sandia/oscil_dcop_34	Sandia/oscil_dcop_35	Sandia/oscil_dcop_36	Sandia/oscil_dcop_37	Sandia/oscil_dcop_38
Sandia/oscil_dcop_39	Sandia/oscil_dcop_40	Sandia/oscil_dcop_41	Sandia/oscil_dcop_42	Sandia/oscil_dcop_43