Application of Fusion-Fission to the Multi-way Graph Partitioning Problem

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

• Type: Conference
• Year: 2007
• Where: PPAM
• Authors: Charles-Edmond Bichot
• Keywords: Cut Partitioning Problem, Graph Partitioning Problem, Mathematics, Multi-way Graph, PPAM 2007