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.

Meszaros/stormg2-125	Meszaros/stormg2-27	Meszaros/stormg2-8	Meszaros/t0331-4l	Meszaros/testbig
Meszaros/tp-6	Meszaros/ts-palko	Meszaros/ulevimin	Meszaros/us04	Meszaros/world
Meszaros/zed	Mittelmann/cont11_l	Mittelmann/cont1_l	Mittelmann/fome11	Mittelmann/fome12
Mittelmann/fome13	Mittelmann/fome20	Mittelmann/fome21	Mittelmann/neos	Mittelmann/neos1