Application of fusion-fission to the multi-way graph partitioning problem

Authors:
Charles-Edmond Bichot
Affiliations:
Laboratoire d'Optimisation Globale, École Nationale de l'Aviation Civile, Direction des Services de la Navigation Aérienne, Toulouse, France
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 15
Cited 0

A multilevel algorithm for partitioning graphs

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Analysis of multilevel graph partitioning

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Multilevel circuit partitioning

DAC '97 Proceedings of the 34th annual Design Automation Conference
How Good is Recursive Bisection?

SIAM Journal on Scientific Computing
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm

SIAM Journal on Scientific Computing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Kernel k-means: spectral clustering and normalized cuts

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Solving the mesh-partitioning problem with an ant-colony algorithm

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning

Journal of Global Optimization
Weighted Graph Cuts without Eigenvectors A Multilevel Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multilevel heuristic algorithm for graph partitioning

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
A metaheuristic based on fusion and fission for partitioning problems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized cut partitioning problem. Its application to the multi-way graph partitioning problem is very recent, thus the Fusion-Fission algorithm has not yet been optimized. Then, the Fusion-Fission algorithm is slower than the state-of-the-art graph partitioning packages. The Fusion-Fission algorithm is compared with JOSTLE, METIS, CHACO and PARTY for four partition's cardinal numbers: 2, 4, 8 and 16, and three partition balance tolerances: 1.00, 1.01 and 1.03. Results show that up to two thirds of time are the partitions returned by Fusion-Fission of greater quality than those returned by state-of-the-art graph partitioning packages.