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.

Hamrle/Hamrle1	Hamrle/Hamrle2	Hamrle/Hamrle3	HB/1138_bus	HB/494_bus
HB/662_bus	HB/685_bus	HB/abb313	HB/arc130	HB/ash219
HB/ash292	HB/ash331	HB/ash608	HB/ash85	HB/ash958
HB/bcspwr01	HB/bcspwr02	HB/bcspwr03	HB/bcspwr04	HB/bcspwr05