Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorWormald, Nick
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationDiaz, J., Serna, M., Wormald, N. "Bounds on the bisection width for random d-regular graphs". 2004.
dc.description.abstractIn 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. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. We provide bounds for 5 d 12. We also give empirical values of the size of the 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.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherRegular graphs
dc.titleBounds on the bisection width for random d-regular graphs
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorDiaz, J.; Serna, M.; Wormald, N.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder