An Energy Model for Visual Graph Clustering

Noack, Andreas (2004) An Energy Model for Visual Graph Clustering. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 425-436(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_40).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-24595-7_40
Classifications: P Styles > P.180 Cluster
M Methods > M.400 Force-directed / Energy-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/472

Actions (login required)

View Item View Item