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.

Bai/tols1090	Bai/tols2000	Bai/tols340	Bai/tols4000	Bai/tols90
Bai/tub100	Bai/tub1000	Barabasi/NotreDame_actors	Barabasi/NotreDame_www	Barabasi/NotreDame_yeast
Bates/Chem97Zt	Bates/Chem97ZtZ	BenElechi/BenElechi1	Bindel/ted_A	Bindel/ted_AB
Bindel/ted_AB_unscaled	Bindel/ted_A_unscaled	Bindel/ted_B	Bindel/ted_B_unscaled	Boeing/bcsstk34