Direct graph k-partitioning with a Kernighan-Lin like heuristic

Authors:
Jesper Larsson TräFf
Affiliations:
C&C Research Laboratories, NEC Europe Ltd., Rathausallee 10, D-53757 Sankt Augustin, Germany
Venue:
Operations Research Letters
Year:
2006

Citing 14
Cited 1

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A multilevel algorithm for partitioning graphs

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
New faster Kernighan-Lin-type graph-partitioning algorithms

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Graph partitioning based methods and tools for scientific computing

Parallel Computing - Special double issue on environment and tools for parallel scientific computing
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
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm

SIAM Journal on Scientific Computing
The Randomized Complexity of Maintaining the Minimum

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Implementing the MPI process topology mechanism

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

D3G2A: the dynamic distributed double guided genetic algorithm for the K-Graph partitioning problem

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the Kernighan-Lin like linear time heuristic for bipartitioning unweighted graphs by Fiduccia and Mattheyses can be generalized to k-partitioning with the same time bounds, avoiding the logarithmic increase incurred by recursive bipartitioning. Furthermore, the direct heuristic allows a better control of the cut.