Think Locally, Act Globally: Highly Balanced Graph Partitioning
Top Cited Papers
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 164-175
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Distributed Evolutionary Graph Partitioning2012
- Better Bounds for Graph BisectionLecture Notes in Computer Science, 2012
- An efficient memetic algorithm for the graph partitioning problemAnnals of Operations Research, 2011
- An effective multilevel tabu search approach for balanced graph partitioningComputers & Operations Research, 2011
- Engineering Multilevel Graph Partitioning Algorithms2011
- n-Level Graph PartitioningLecture Notes in Computer Science, 2010
- Engineering a scalable high quality graph partitioner2010
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular GraphsSIAM Review, 1999
- Negative-cycle detection algorithms1996
- A Linear-Time Heuristic for Improving Network Partitions1982