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/Tina_DisCog	Pajek/USAir97	Pajek/USpowerGrid	Pajek/Wordnet3	Pajek/WorldCities
Pajek/yeast	Pajek/Zewail	PARSEC/benzene	PARSEC/CO	PARSEC/Ga10As10H30
PARSEC/Ga19As19H42	PARSEC/Ga3As3H12	PARSEC/Ga41As41H72	PARSEC/GaAsH6	PARSEC/Ge87H76
PARSEC/Ge99H100	PARSEC/H2O	PARSEC/Na5	PARSEC/Si10H16	PARSEC/Si2