Graph bisection algorithms with good average case behavior
T. N. Bui, S. Chaudhuri, Frank Thomson Leighton et al. · COMBINATORICA · 1987
Cited by 323 works. doi:10.1007/bf02579448
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Optimization by Simulated Annealing
- An Efficient Heuristic Procedure for Partitioning Graphs
- Some simplified NP-complete graph problems
- A Separator Theorem for Planar Graphs
- Lower Bounds for the Partitioning of Graphs
- A Linear-Time Heuristic for Improving Network Partitions
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
- Applications of a planar separator theorem
- A framework for solving VLSI graph layout problems