Parallelism in graph-partitioning
John E. Savage, Markus G. Wloka · Journal of Parallel and Distributed Computing · 1991
Cited by 46 works. doi:10.1016/0743-7315(91)90074-j
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Optimization by Simulated Annealing
- An Efficient Heuristic Procedure for Partitioning Graphs
- The Connection Machine
- Computational Complexity of Probabilistic Turing Machines
- Scans as primitive parallel operations
- The complexity of computing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Graph bisection algorithms with good average case behavior
- An Improved Min-Cut Algonthm for Partitioning VLSI Networks