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.

LPnetlib/lp_scfxm1	LPnetlib/lp_scfxm2	LPnetlib/lp_scfxm3	LPnetlib/lp_scorpion	LPnetlib/lp_scrs8
LPnetlib/lp_scsd1	LPnetlib/lp_scsd6	LPnetlib/lp_scsd8	LPnetlib/lp_sctap1	LPnetlib/lp_sctap2
LPnetlib/lp_sctap3	LPnetlib/lp_share1b	LPnetlib/lp_share2b	LPnetlib/lp_shell	LPnetlib/lp_ship04l
LPnetlib/lp_ship04s	LPnetlib/lp_ship08l	LPnetlib/lp_ship08s	LPnetlib/lp_ship12l	LPnetlib/lp_ship12s