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.

Pajek/GD95_a	Pajek/GD95_b	Pajek/GD95_c	Pajek/GD96_a	Pajek/GD96_b
Pajek/GD96_c	Pajek/GD96_d	Pajek/GD97_a	Pajek/GD97_b	Pajek/GD97_c
Pajek/GD98_a	Pajek/GD98_b	Pajek/GD98_c	Pajek/GD99_b	Pajek/GD99_c
Pajek/geom	Pajek/GlossGT	Pajek/HEP-th	Pajek/HEP-th-new	Pajek/IMDB