Mostra el registre d'ítem simple
Dominating sets in planar graphs: branch-width and exponential speed-up
| dc.contributor.author | Fomin, Fedor V. |
| dc.contributor.author | Thilikos Touloupas, Dimitrios |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2016-11-29T11:16:31Z |
| dc.date.available | 2016-11-29T11:16:31Z |
| dc.date.issued | 2002-12 |
| dc.identifier.citation | Fomin, F., Thilikos, D. "Dominating sets in planar graphs: branch-width and exponential speed-up". 2002. |
| dc.identifier.uri | http://hdl.handle.net/2117/97398 |
| dc.description.abstract | 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. |
| dc.format.extent | 32 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-02-73-R |
| dc.subject | Àrees temàtiques de la UPC::Informàtica |
| dc.subject.other | Graph minors theory |
| dc.subject.other | Graph algorithms |
| dc.subject.other | Dominating sets |
| dc.subject.other | Planar graphs |
| dc.subject.other | Branch-width |
| dc.subject.other | Tree-width |
| dc.subject.other | Dominating set |
| dc.subject.other | Planar graph |
| dc.subject.other | Fixed parameter algorithm |
| dc.title | Dominating sets in planar graphs: branch-width and exponential speed-up |
| dc.type | External research report |
| dc.rights.access | Open Access |
| local.identifier.drac | 1903043 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Fomin, F.; Thilikos, D. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]