Article contents
Comparison of algorithms in graph partitioning
Published online by Cambridge University Press: 04 April 2009
Abstract
We first describe four recent methods to cluster vertices of an undirected non weighted connected graph. They are all based on very different principles. The fifth is a combination of classical ideas in optimization applied to graph partitioning. We compare these methods according to their ability to recover classes initially introduced in random graphs with more edges within the classes than between them.
- Type
- Research Article
- Information
- RAIRO - Operations Research , Volume 42 , Issue 4: ALIO/EURO V Conference on Combinatorial Optimization , October 2008 , pp. 469 - 484
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2008
References
- 3
- Cited by