Fast Approximate Graph Partitioning Algorithms
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (6) , 2187-2214
- https://doi.org/10.1137/s0097539796308217
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Path optimization for graph partitioning problemsDiscrete Applied Mathematics, 1999
- Approximating Minimum Feedback Sets and Multicuts in Directed GraphsAlgorithmica, 1998
- How Good is Recursive Bisection?SIAM Journal on Scientific Computing, 1997
- Approximation Algorithms for Steiner and Directed MulticutsJournal of Algorithms, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Fast Approximation Algorithms for Fractional Packing and Covering ProblemsMathematics of Operations Research, 1995
- Fast Approximation Algorithms for Multicommodity Flow ProblemsJournal of Computer and System Sciences, 1995
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970