## An Energy Model for Visual Graph Clustering (2003)

### Cached

### Download Links

- [www-sst.informatik.tu-cottbus.de]
- [www-sst.informatik.tu-cottbus.de]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), LNCS 2912 |

Citations: | 41 - 4 self |

### BibTeX

@INPROCEEDINGS{Noack03anenergy,

author = {Andreas Noack},

title = {An Energy Model for Visual Graph Clustering},

booktitle = {Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), LNCS 2912},

year = {2003},

pages = {425--436},

publisher = {Springer-Verlag}

}

### OpenURL

### 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 bestknown 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.