On minimum vertex bisection of random d-regular graphs
Authors:
- Josep DíazJDJosep Díaz
- Öznur Yaşar DinerÖDÖznur Yaşar Diner
- Maria SernaMSMaria Serna
- Oriol SerraOSOriol Serra
Open Access
- 15 May 2024
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 144
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Minimum bisection is NP-hard on unit disk graphsInformation and Computation, 2017
- On the Parameterized Complexity of Computing Balanced Partitions in GraphsTheory of Computing Systems, 2014
- The cook-book approach to the differential equation methodComputer Science Review, 2010
- Bounds on the bisection width for random d -regular graphsTheoretical Computer Science, 2007
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- On the bipartition of graphsDiscrete Applied Mathematics, 1984
- The diameter of random regular graphsCombinatorica, 1982
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970