Direct graph -partitioning with a Kernighan–Lin like heuristic
Author:
- Jesper Larsson TräffJTJesper Larsson Träff
- 1 November 2006
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 34 (6) , 621-629
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- New faster Kernighan-Lin-type graph-partitioning algorithms2002
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- How Good is Recursive Bisection?SIAM Journal on Scientific Computing, 1997
- Graph partitioning based methods and tools for scientific computingParallel Computing, 1997
- The randomized complexity of maintaining the minimum1996
- A multilevel algorithm for partitioning graphs1995
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- A Linear-Time Heuristic for Improving Network Partitions1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970