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_sierra	LPnetlib/lp_stair	LPnetlib/lp_standata	LPnetlib/lp_standgub	LPnetlib/lp_standmps
LPnetlib/lp_stocfor1	LPnetlib/lp_stocfor2	LPnetlib/lp_stocfor3	LPnetlib/lp_truss	LPnetlib/lp_tuff
LPnetlib/lp_vtp_base	LPnetlib/lp_wood1p	LPnetlib/lp_woodw	Lucifora/cell1	Lucifora/cell2
Mallya/lhr01	Mallya/lhr02	Mallya/lhr04	Mallya/lhr04c	Mallya/lhr07