Show simple item record

dc.contributor.authorHajiaghayi, Mohammad Taghi
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorThilikos Touloupas, Dimitrios
dc.date.accessioned2016-11-30T14:35:59Z
dc.date.available2016-11-30T14:35:59Z
dc.date.issued2002-03
dc.identifier.citationHajiaghayi, M., Demaine, E., Thilikos, D. "Exponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs". 2002.
dc.identifier.urihttp://hdl.handle.net/2117/97525
dc.description.abstractWe present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K_{5} or K_3,3 as a minor in time O(3^{6sqrt{34 k}}n^{O(1)}). In fact, we present our algorithm for any H-minor-free graph where H is a single-crossing graph (can be drawn on the plane with at most one crossing) and obtain the algorithm for K_{3,3} (K_{5})-minor-free graphs as a special case. As a consequence, we extend our results to several other problems such as vertex cover, edge dominating set, independent set, clique-transversal set, kernels in digraphs, feedback vertex set and a series of vertex removal problems. Our work generalizes and extends the recent result of exponential speedup in designing fixed-parameter algorithms on planar graphs due to Alber et al. to other (non-planar) classes of graphs.
dc.format.extent22 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-02-29-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.otherFixed parameter algorithm
dc.subject.otherExponential speedup
dc.titleExponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac1903039
dc.description.versionPostprint (published version)
local.citation.authorHajiaghayi, M.; Demaine, E.; Thilikos, D.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder