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 2218 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 (Schenk@nlpkkt240) has 27,993,600 vertices and 366,327,376 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.

Meszaros/nemspmm1	Meszaros/nemspmm2	Meszaros/nemswrld	Meszaros/nl	Meszaros/nsct
Meszaros/nsic	Meszaros/nsir	Meszaros/nw14	Meszaros/p0033	Meszaros/p0040
Meszaros/p010	Meszaros/p0201	Meszaros/p0282	Meszaros/p0291	Meszaros/p05
Meszaros/p0548	Meszaros/p2756	Meszaros/p6000	Meszaros/pcb1000	Meszaros/pcb3000