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.

Oberwolfach/t2dal_bci	Oberwolfach/t2dal_e	Oberwolfach/t3dh	Oberwolfach/t3dh_a	Oberwolfach/t3dh_e
Oberwolfach/t3dl	Oberwolfach/t3dl_a	Oberwolfach/t3dl_e	Oberwolfach/windscreen	Okunbor/aft01
Okunbor/aft02	Pajek/California	Pajek/Cities	Pajek/CSphd	Pajek/dictionary28
Pajek/divorce	Pajek/EAT_RS	Pajek/EAT_SR	Pajek/EPA	Pajek/Erdos02