Cited By
View all- Bichot C(2013)Local Metaheuristics and Graph PartitioningGraph Partitioning10.1002/9781118601181.ch6(137-161)Online publication date: 13-Feb-2013
Metaheuristics for graph bisection
Pages 1801 - 1802
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.
References
[1]
C.-E. Bichot. A new meta-method for graph partitioning. In Proceedings of the 2008 IEEE Congress on Evolutionary Computation, pages 3498--3505, June 2008.
[2]
T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. on Computers, 45(7):841--855, 1996.
[3]
G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96--129, 1998.
[4]
H. R. Lorenco, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics. Kluwer, 2002.
[5]
F. Pellegrini. SCOTCH 5.1 User's guide. ENSEIRB -- LaBRI, Université de Bordeaux I, 2008.
[6]
T. Stützle. Iterated local search for the quadratic assignment problem. European Journal of Operational Research, 174(3):1519--1539, 2006.
Index Terms
- Metaheuristics for graph bisection
Recommendations
Metaheuristics for large-scale instances of the linear ordering problem
ILS and GDA metaheuristics for the linear ordering problem are introduced.They are able to tackle large instances in line with real applications.Introduced methods are the first of their kind ever applied to large-sized instances.All best known ...
Subgraph extraction and metaheuristics for the maximum clique problem
The maximum clique problem involves finding the largest set of pairwise adjacent vertices in a graph. The problem is classic but still attracts much attention because of its hardness and its prominent applications. Our work is based on the existence of ...
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
Highlights- We study the Minimum Conductance Graph Partitioning Problem.
- We design an ...
AbstractThe minimum conductance graph partitioning problem (MC-GPP) is to partition the vertex set of a graph into two disjoint subsets while minimizing the ratio between the number of the edges crossing the two subsets and the smallest volume ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 Copyright is held by the author/owner(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2009
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 136Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Reflects downloads up to 21 Sep 2024
Other Metrics
Citations
Cited By
View all- Bichot C(2013)Local Metaheuristics and Graph PartitioningGraph Partitioning10.1002/9781118601181.ch6(137-161)Online publication date: 13-Feb-2013
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in