Experiments on Graph Clustering Algorithms
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On clusterings-good, bad and spectralPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A clustering algorithm based on graph connectivityInformation Processing Letters, 2000
- Data clusteringACM Computing Surveys, 1999
- Eigenvalues, flows and separators of graphsPublished by Association for Computing Machinery (ACM) ,1997
- Spectral partitioning works: planar graphs and finite element meshesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- A near optimal algorithm for edge separators (preliminary version)Published by Association for Computing Machinery (ACM) ,1994
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971