Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor

Athenstädt, Jan Christoph and Görke, Robert and Krug, Marcus and Nöllenburg, Martin (2013) Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 553-554(Official URL:

Full text not available from this repository.


Indroduction. Large graphs appear in many application domains. Their analysis can be done automatically by machines, for which the graph size is less of a problem, or, especially for exploration tasks, visually by humans. The graph drawing literature contains many efficient methods for visualizing large graphs, see e.g. [4, Chapter 12], but for large graphs it is often useful to first compute a sequence of coarser and more abstract representations by grouping vertices recursively using a hierarchical clustering algorithm. Then the task is to compute an overview picture of the graph based on a given cluster hierarchy, such that details of the graph, e.g., within clusters, remain visible on demand.

Item Type: Conference Poster
Additional Information: 10.1007/978-3-642-36763-2_49
Classifications: G Algorithms and Complexity > G.350 Clusters
P Styles > P.180 Cluster
P Styles > P.060 3D

Actions (login required)

View Item View Item