Constructive linear time algorithms for branchwidth
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth at most k and, if so, outputs a branch decomposition of minimum width.
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2000 |
| 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/96447 |
| Acceso en línea: | https://hdl.handle.net/2117/96447 |
| Access Level: | acceso abierto |
| Palabra clave: | Constructive linear time Algorithms for branchwidth Àrees temàtiques de la UPC::Informàtica |
| Sumario: | We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth at most k and, if so, outputs a branch decomposition of minimum width. |
|---|