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.

Hollinger/g7jac180	Hollinger/g7jac180sc	Hollinger/g7jac200	Hollinger/g7jac200sc	Hollinger/jan99jac020
Hollinger/jan99jac020sc	Hollinger/jan99jac040	Hollinger/jan99jac040sc	Hollinger/jan99jac060	Hollinger/jan99jac060sc
Hollinger/jan99jac080	Hollinger/jan99jac080sc	Hollinger/jan99jac100	Hollinger/jan99jac100sc	Hollinger/jan99jac120
Hollinger/jan99jac120sc	Hollinger/mark3jac020	Hollinger/mark3jac020sc	Hollinger/mark3jac040	Hollinger/mark3jac040sc