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.

HB/west0497	HB/west0655	HB/west0989	HB/west1505	HB/west2021
HB/will199	HB/will57	HB/wm1	HB/wm2	HB/wm3
HB/young1c	HB/young2c	HB/young3c	HB/young4c	HB/zenios
Hohn/fd12	Hohn/fd15	Hohn/fd18	Hohn/sinc12	Hohn/sinc15