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/gas_sensor	Oberwolfach/gyro	Oberwolfach/gyro_k	Oberwolfach/gyro_m	Oberwolfach/inlet
Oberwolfach/LF10	Oberwolfach/LF10000	Oberwolfach/LFAT5	Oberwolfach/LFAT5000	Oberwolfach/piston
Oberwolfach/rail_1357	Oberwolfach/rail_20209	Oberwolfach/rail_5177	Oberwolfach/rail_79841	Oberwolfach/spiral
Oberwolfach/t2dah	Oberwolfach/t2dah_a	Oberwolfach/t2dah_e	Oberwolfach/t2dal	Oberwolfach/t2dal_a