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/fpga_dcop_41	Sandia/fpga_dcop_42	Sandia/fpga_dcop_43	Sandia/fpga_dcop_44	Sandia/fpga_dcop_45
Sandia/fpga_dcop_46	Sandia/fpga_dcop_47	Sandia/fpga_dcop_48	Sandia/fpga_dcop_49	Sandia/fpga_dcop_50
Sandia/fpga_dcop_51	Sandia/fpga_trans_01	Sandia/fpga_trans_02	Sandia/init_adder1	Sandia/mult_dcop_01
Sandia/mult_dcop_02	Sandia/mult_dcop_03	Sandia/oscil_dcop_01	Sandia/oscil_dcop_02	Sandia/oscil_dcop_03