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.

Gset/G60	Gset/G61	Gset/G62	Gset/G63	Gset/G64
Gset/G65	Gset/G66	Gset/G67	Gset/G7	Gset/G8
Gset/G9	Gupta/gupta1	Gupta/gupta2	Gupta/gupta3	Hamm/add20
Hamm/add32	Hamm/bcircuit	Hamm/hcircuit	Hamm/memplus	Hamm/scircuit