To access the full text documents, please follow this link: http://hdl.handle.net/2117/97430
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor.author | Fomin, Fedor V. |
dc.contributor.author | Thilikos Touloupas, Dimitrios |
dc.date | 2002-08 |
dc.identifier.citation | Fomin, F., Thilikos, D. "New upper bounds on the decomposability of planar graphs and fixed parameter algorithms". 2002. |
dc.identifier.uri | http://hdl.handle.net/2117/97430 |
dc.description.abstract | It is known that a planar graph on n vertices has branch-width/tree-width bounded by alphasqrt{n}. In many algorithmic applications it is useful to have a small bound on the constant alpha. We give a proof of the best, so far, upper bound for the constant alpha. In particular, for the case of tree-width, alpha<3.182 and for the case of branch-width, alpha<2.122. Our proof is based on the planar separation theorem of Alon, Seymour & Thomas and some min-max theorem of the graph minors series. Based on these bounds we introduce a new method for solving different fixed parameter problems on planar graphs. We prove that our method provides the best so far exponential speed-up for fundamental problems on planar graphs like Vertex Cover, Dominating Set, Independent Set and many others. |
dc.language.iso | eng |
dc.relation | LSI-02-56-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject | Planar graphs |
dc.subject | Decomposability |
dc.subject | Fixed parameter algorithms |
dc.subject | Tree-width |
dc.subject | Branch-width |
dc.subject | Separation theorems |
dc.subject | Vertex cover |
dc.subject | Dominating set |
dc.title | New upper bounds on the decomposability of planar graphs and fixed parameter algorithms |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |