Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/98586
Título:
|
Bounds on the bisection width for random d-regular graphs
|
Autor/a:
|
Díaz Cort, Josep; Serna Iglesias, María José; Wormald, Nick
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
Abstract:
|
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. 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. |
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Regular graphs |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión publicada Informe |
Compartir:
|
|
Mostrar el registro completo del ítem