Abstract
Purchase PDF (268 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (3)
Purchase PDF (260 K)
3, several results for gossiping in graphs of constant degree and planar graphs, as well as similar results for the related edge-disjoint paths mode follow.
doi:10.1016/S0304-3975(03)00236-6 
Copyright © 2003 Elsevier B.V. All rights reserved.
Bounds on the max and min bisection of random cubic and random 4-regular graphs*1
Available online 29 April 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we present a randomized algorithm to compute the bisection width of cubic and 4-regular graphs. The analysis of the proposed algorithms on random graphs provides asymptotic upper bounds for the bisection width of random cubic and random 4-regular graphs with n vertices, giving upper bounds of 0.174039n for random cubic, and of 0.333333n for random 4-regular. We also obtain asymptotic lower bounds for the size of the maximum bisection, for random cubic and random 4-regular graphs with n vertices, of 1.32697n and 1.66667n, respectively. The randomized algorithms are derived from initial greedy algorithm and their analysis is based on the differential equation method.
Author Keywords: Bisection width; Random cubic graphs; Random 4-regular graphs
