Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic

DOI10.1016/j.orl.2005.10.003zbMath1109.05089OpenAlexW2076501463MaRDI QIDQ867921

Jesper Larsson Träff

Publication date: 19 February 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.10.003

zbMATH Keywords

bipartitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Uses Software

• MPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph partitioning based methods and tools for scientific computing
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• How Good is Recursive Bisection?
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• The randomized complexity of maintaining the minimum
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic