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_Homology/n3c4-b3 JGD_Homology/n3c4-b4 JGD_Homology/n3c5-b1 JGD_Homology/n3c5-b2 JGD_Homology/n3c5-b3 JGD_Homology/n3c5-b4 JGD_Homology/n3c5-b5 JGD_Homology/n3c5-b6 JGD_Homology/n3c5-b7 JGD_Homology/n3c6-b1 JGD_Homology/n3c6-b10 JGD_Homology/n3c6-b11 JGD_Homology/n3c6-b2 JGD_Homology/n3c6-b3 JGD_Homology/n3c6-b4 JGD_Homology/n3c6-b5 JGD_Homology/n3c6-b6 JGD_Homology/n3c6-b7 JGD_Homology/n3c6-b8 JGD_Homology/n3c6-b9