Metaheuristics for graph bisection

Charles-Edmond Bichot 1
1 imagine - Extraction de Caractéristiques et Identification
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : This paper compares several metaheuristics on the balanced graph bisection problem and identifies their relative performance on structured test graphs. For this purpose, a Simple implementation of a graph Bisection Iterated Local Search algorithm (SBILS) is introduced. Its results are compared to the well-known Genetic Bisection Algorithm, to the state-of-the-art graph partitioning programs Metis and Scotch, and to the Fusion-Fission graph partitioning metaheuristic.
Type de document :
Poster
10th Genetic and Evolutionary Computation Conference (GECCO), Jul 2009, Montréal, Canada. ACM, pp.1801-1802, 2009, <10.1145/1569901.1570169>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01437708
Contributeur : Équipe Gestionnaire Des Publications Si Liris <>
Soumis le : mardi 17 janvier 2017 - 13:56:25
Dernière modification le : mercredi 18 janvier 2017 - 01:06:15

Identifiants

Collections

Citation

Charles-Edmond Bichot. Metaheuristics for graph bisection. 10th Genetic and Evolutionary Computation Conference (GECCO), Jul 2009, Montréal, Canada. ACM, pp.1801-1802, 2009, <10.1145/1569901.1570169>. <hal-01437708>

Partager

Métriques

Consultations de la notice

70