Graph bisection algorithms with good average case behavior
- 1 June 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (2) , 171-191
- https://doi.org/10.1007/bf02579448
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Approximation algorithms for NP-complete problems on planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- The diameter of random regular graphsCombinatorica, 1982
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An algorithm for partitioning the nodes of a graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Applications of a planar separator theoremPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970