In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. We provide the bounds for 5 ≤ d ≤ 12. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. We also give empirical values of the size of bisection found by the algorithm for some small values of d and compare it with numerical approximations of our theoretical bounds. Our analysis also gives asymptotic lower bounds for the size of the maximum bisection. © Springer-Verlag 2004.
CITATION STYLE
Díaz, J., Serna, M. J., & Wormald, N. C. (2004). Computation of the bisection width for random d-regular graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 49–58. https://doi.org/10.1007/978-3-540-24698-5_9
Mendeley helps you to discover research relevant for your work.