Experiments on graph clustering algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 568-579

  Brandes, Ulrik ^a,b   Gaertler, Marco ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF PASSAU   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EXPERIMENTAL EVALUATION; GEOMETRIC CLUSTERING; GRAPH CLUSTERING; GRAPH CLUSTERING ALGORITHMS; GRAPH PARTITIONING; INTER CLUSTERS; INTRA-CLUSTER; NEW APPROACHES;

CLUSTERING ALGORITHMS;

EID: 0142214892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_52     Document Type: Article

References (15)

1. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall (1988)
2. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys 31 (1999) 264-323
3. Kannan, R., Vampala, S., Vetta, A.: On Clustering - Good, Bad and Spectral. In: Foundations of Computer Science 2000. (2000) 367-378
4. van Dongen, S.M.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)
5. Harel, D., Koren, Y.: On clustering using random walks. Foundations of Software Technology and Theoretical Computer Science 2245 (2001) 18-41
6. Hartuv, E., Shamir, R.: A clustering algorithm based on'graph connectivity. Information Processing Letters 76 (2000) 175-181
7. Spielman, D.A., Teng, S.H.: Spectral partitioning works: Planar graphs and finite element meshes. In: IEEE Symposium on Foundations of Computer Science. (1996) 96-105
8. Chung, F., Yau, S.T.: Eigenvalues, flows and separators of graphs. In: Proceeding of the 29th Annual ACM Symposium on Theory of Computing. (1997) 749
9. Chung, F., Yau, S.T.: A near optimal algorithm for edge separators. In: Proceeding of the 26th Annual ACM Symposium on Theory of Computing. (1994) 1-8
10. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamcla, A., Protasi, M.: Complexity and Approximation - Combinatorial optimization problems and their approximability properties. Springer-Verlag (1999)
11. Wagner, D., Wagner, F.: Between Min Cut and Graph Bisection. In Borzyszkowski, A.M., Sokolowski, S., eds.: Lecture Notes in Computer Science, Springer-Verlag (1993) 744-750
12. Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976) 237-267
13. Gaertler, M.: Clustering with spectral methods. Master's thesis, Universität Konstanz (2002)
14. Zahn, C.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers C-20 (1971) 68-86
15. Chung, F.R.K.: Spectral Graph Theory. Number 52 in Conference Board of the Mathematical Sciences. American Mathematical Society (1994)