Computation of bisection width for random d-regular graphs
In this paper we describe a randomized greedy algorithm for obtaining bisections of graphs. Analysis of the algorithm's performance on random d-regular graphs yields asymptotically almost sure upper bounds on the bisection width of such graphs with n vertices, as n goes to infinity. We also giv...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Institución: | 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/97320 |
| Acceso en línea: | https://hdl.handle.net/2117/97320 |
| Access Level: | acceso abierto |
| Palabra clave: | Randomized greedy algorithm Graphs bisections Bisection width Random d-regular graphs Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | In this paper we describe a randomized greedy algorithm for obtaining bisections of graphs. Analysis of the algorithm's performance on random d-regular graphs yields asymptotically almost sure upper bounds on the bisection width of such graphs with n vertices, as n goes to infinity. We also give empirical values of the size of bisection found by the algorithm for some small values of d. |
|---|