A Gallery of Large Graphs

graph visualization of matrices from the University of Florida Collection

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 using sfdp algorithm . The resulting gallery contains the drawing of graphs as represented by 2568 sparse matrices in this collection. Each of these sparse matrices (a rectangular matrix is treated as a bipartite graph) 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 graphs have tens of millions of nodes and over a billion of edges. A simple coloring scheme is used: longer edges are colored with colder colors, and short ones warmer. The graphs are in alphabetical order. Use the "Search" link to find graphs of specific characters.

 JGD_G5/IG5-12 JGD_G5/IG5-13 JGD_G5/IG5-14 JGD_G5/IG5-15 JGD_G5/IG5-16 JGD_G5/IG5-17 JGD_G5/IG5-18 JGD_G5/IG5-6 JGD_G5/IG5-7 JGD_G5/IG5-8 JGD_G5/IG5-9 JGD_GL6/GL6_D_10 JGD_GL6/GL6_D_6 JGD_GL6/GL6_D_7 JGD_GL6/GL6_D_8 JGD_GL6/GL6_D_9 JGD_GL7d/GL7d10 JGD_GL7d/GL7d11 JGD_GL7d/GL7d12 JGD_GL7d/GL7d13