2008 · 38 citations · 23 references
ComputingComputer ScienceVisualizationData VisualizationGraph VisualizationInformation VisualizationForce-directed LayoutsGraph AlgorithmsGraph DrawingGraph Layout AlgorithmsHierarchical VisualizationLarge Graph VisualizationClusteringHierarchyIterative LearningTree Map Layout AlgorithmsTree-map-based Graph VisualizationTreemap VisualizationsTreemapsZooming
Abstract graphs or networks are a commonly recurring data type in many fields. In order to visualize such graphs effectively, the graph must be laid out on the screen coherently. Many algorithms exist to do this, but many of these algorithms tend to be very slow when the input graph is large. This paper presents a new approach to the large graph layout problem, which quickly generates an effective layout. This new method proceeds by generating a clustering hierarchy for the graph, applying a treemap to this hierarchy, and finally placing the graph vertices in their associated regions in the treemap. It is ideal for interactive systems where operations such as semantic zooming are to be performed, since most of the work is done in the initial hierarchy calculation, and it takes very little work to recalculate the layout. This method is also valuable in that the resulting layout can be used as the input to an iterative algorithm (e.g., a force directed method), which greatly reduces the number of iterations required to converge to a near optimal layout.
23
Finding community structure in very large networks
Aaron Clauset, M. E. J. Newman, Cristopher Moore · Physical Review E · 2004 · 7.5K citations · Full text
Hierarchical Clustering Schemes
S. C. Johnson · Psychometrika · 1967 · 4.9K citations
An algorithm for drawing general undirected graphs
Tomihisa Kamada, Satoru Kawai · Information Processing Letters · 1989 · 2.8K citations