Dominating sets in planar graphs: branch-width and exponential speed-up
Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very de...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2002 |
| 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/97398 |
| Acceso en línea: | https://hdl.handle.net/2117/97398 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph minors theory Graph algorithms Dominating sets Planar graphs Branch-width Tree-width Dominating set Planar graph Fixed parameter algorithm Àrees temàtiques de la UPC::Informàtica |
| Sumario: | Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known practical algorithms on different domination problems. |
|---|