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/lpi_qual	LPnetlib/lpi_reactor	LPnetlib/lpi_refinery	LPnetlib/lp_israel	LPnetlib/lpi_vol1
LPnetlib/lpi_woodinfe	LPnetlib/lp_kb2	LPnetlib/lp_ken_07	LPnetlib/lp_ken_11	LPnetlib/lp_ken_13
LPnetlib/lp_ken_18	LPnetlib/lp_lotfi	LPnetlib/lp_maros	LPnetlib/lp_maros_r7	LPnetlib/lp_modszk1
LPnetlib/lp_osa_07	LPnetlib/lp_osa_14	LPnetlib/lp_osa_30	LPnetlib/lp_osa_60	LPnetlib/lp_pds_02