# 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_Kocay/Trec9 JGD_Margulies/cat_ears_2_1 JGD_Margulies/cat_ears_2_4 JGD_Margulies/cat_ears_3_1 JGD_Margulies/cat_ears_3_4 JGD_Margulies/cat_ears_4_1 JGD_Margulies/cat_ears_4_4 JGD_Margulies/flower_4_1 JGD_Margulies/flower_4_4 JGD_Margulies/flower_5_1 JGD_Margulies/flower_5_4 JGD_Margulies/flower_7_1 JGD_Margulies/flower_7_4 JGD_Margulies/flower_8_1 JGD_Margulies/flower_8_4 JGD_Margulies/kneser_10_4_1 JGD_Margulies/kneser_6_2_1 JGD_Margulies/kneser_8_3_1 JGD_Margulies/wheel_3_1 JGD_Margulies/wheel_4_1