A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present two randomized algorithms to bound the bisection width of random n-vertex cubic graphs. We obtain an asymptotic upper bound for the bisection width of 0.174039n and a corresponding lower bound of 1.325961n. The analysis is based on the differential equation method.doi:10.1007/3-540-45726-7_10 fatcat:ybvneqiwnraxtnpg7cycmp53my