An Energy Model for Visual Graph Clustering

  • Andreas Noack
Conference paper

DOI: 10.1007/978-3-540-24595-7_40

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2912)
Cite this paper as:
Noack A. (2004) An Energy Model for Visual Graph Clustering. In: Liotta G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg


We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes outside the set. The drawings of the best-known force and energy models do not clearly show clusters for graphs whose diameter is small relative to the number of nodes. We formally characterize the minimum energy drawings of our energy model. This characterization shows in what sense the drawings separate clusters, and how the distance of separated clusters to the other nodes can be interpreted.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andreas Noack
    • 1
  1. 1.Institute of Computer Science BrandenburgTechnical University at CottbusCottbusGermany

Personalised recommendations