Bounds on the bisection width for random d-regular graphs
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 graph...
| Autores: | , , |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 2004 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/98586 |
| Acesso em linha: | https://hdl.handle.net/2117/98586 |
| Access Level: | acceso abierto |
| Palavra-chave: | Regular graphs Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | 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. |
|---|