Drawing graphs: methods and models

By M. Kaufmann, Dorothea Wagner. 2001

433 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Geometry-Based Edge Clustering for Graph Visualization (2008, background): “Many efforts have been devoted to generate good graph layouts [2, 15].”
Modularity clustering is force-directed layout (2008, background): “Requirements like the grouping of densely connected vertices are often formalized as mathematical functions called quality measures, and the optimization of quality measures is a common strategy for the computation of both layouts [2, 3] and clusterings [4, 5, 6, 7].”
Tulip - A Huge Graph Visualization Framework (2004, methodology): “These algorithms can be divided into two groups: the intrinsic clustering algorithms and the extrinsic cluster ing algorithms [ 19 ].”
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data (2006, background): “Furthermore, Kaufmann et al. provide a more general survey on drawing clusters (and hierarchies) [16].”