## Visual Clustering of Graphs with Nonuniform Degrees (2004)

### Cached

### Download Links

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

### Other Repositories/Bibliography

by
Andreas Noack

Venue: | Proceedings of the 13th International Symposium on Graph Drawing (GD 2005 |

Citations: | 28 - 2 self |

### BibTeX

@INPROCEEDINGS{Noack04visualclustering,

author = {Andreas Noack},

title = {Visual Clustering of Graphs with Nonuniform Degrees},

booktitle = {Proceedings of the 13th International Symposium on Graph Drawing (GD 2005},

year = {2004},

pages = {309--320},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

We discuss several criteria for clustering graphs, and identify two criteria which are not biased towards certain cluster sizes: the node-normalized cut (also called cut ratio) and the edge-normalized cut. We present two energy models whose minimum energy drawings reveal clusters with respect to these criteria.