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.

VanVelzen/Zd_Jac2	VanVelzen/Zd_Jac2_db	VanVelzen/Zd_Jac3	VanVelzen/Zd_Jac3_db	VanVelzen/Zd_Jac6
VanVelzen/Zd_Jac6_db	Vavasis/av41092	Wang/swang1	Wang/swang2	Wang/wang1
Wang/wang2	Wang/wang3	Wang/wang4	Watson/Baumann	Watson/chem_master1
Wissgott/parabolic_fem	YCheng/psse0	YCheng/psse1	YCheng/psse2	Zaoui/kkt_power