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.
- Large Graph
- Hierarchical Cluster Algorithm
- Graph Drawing
- Cluster Hierarchy
- Parent Cluster
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.