Voir la notice de l'article provenant de la source Numdam
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.
@article{RO_2008__42_4_469_0,
author = {Gu\'enoche, Alain},
title = {Comparison of algorithms in graph partitioning},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {469--484},
publisher = {EDP-Sciences},
volume = {42},
number = {4},
year = {2008},
doi = {10.1051/ro:2008029},
mrnumber = {2469107},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro:2008029/}
}
TY - JOUR AU - Guénoche, Alain TI - Comparison of algorithms in graph partitioning JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2008 SP - 469 EP - 484 VL - 42 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro:2008029/ DO - 10.1051/ro:2008029 LA - en ID - RO_2008__42_4_469_0 ER -
%0 Journal Article %A Guénoche, Alain %T Comparison of algorithms in graph partitioning %J RAIRO - Operations Research - Recherche Opérationnelle %D 2008 %P 469-484 %V 42 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro:2008029/ %R 10.1051/ro:2008029 %G en %F RO_2008__42_4_469_0
Guénoche, Alain. Comparison of algorithms in graph partitioning. RAIRO - Operations Research - Recherche Opérationnelle, Tome 42 (2008) no. 4, pp. 469-484. doi: 10.1051/ro:2008029
Cité par Sources :