Automatic Graph Clustering (System Demonstration)

Sablowski, Reinhard and Frick, Arne (1997) Automatic Graph Clustering (System Demonstration). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 395-400(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_63).

Full text not available from this repository.

Abstract

We present a new, easy to understand algorithm and programming environment allowing for the interactive or automatic clustering of graphs according to several heuristics. Our approach is based on graph structure only and can be implemented to run efficiently with a personal computer. It is capable of efficiently clustering graphs with >3000 vertices. We shall demonstrate the interactive user environmentfor automatic clustering. As an application, we consider the clustering of large WWW connectivity graphs.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_63
Classifications: M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.350 Clusters
URI: http://gdea.informatik.uni-koeln.de/id/eprint/111

Actions (login required)

View Item View Item