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.

Hohn/sinc18	Hollinger/g7jac010	Hollinger/g7jac010sc	Hollinger/g7jac020	Hollinger/g7jac020sc
Hollinger/g7jac040	Hollinger/g7jac040sc	Hollinger/g7jac050sc	Hollinger/g7jac060	Hollinger/g7jac060sc
Hollinger/g7jac080	Hollinger/g7jac080sc	Hollinger/g7jac100	Hollinger/g7jac100sc	Hollinger/g7jac120
Hollinger/g7jac120sc	Hollinger/g7jac140	Hollinger/g7jac140sc	Hollinger/g7jac160	Hollinger/g7jac160sc