Vis enkel innførsel

dc.contributor.authorAgrawal, Akanksha
dc.contributor.authorFomin, Fedor
dc.contributor.authorLokshtanov, Daniel
dc.contributor.authorSaurabh, Saket
dc.contributor.authorTale, Prafullkumar
dc.date.accessioned2020-08-07T13:09:31Z
dc.date.available2020-08-07T13:09:31Z
dc.date.issued2019
dc.PublishedAgrawal A, Fomin V, Lokshtanov D, Saurabh S, Tale P. Path Contraction Faster Than 2n. Leibniz International Proceedings in Informatics. 2019;132eng
dc.identifier.issn1868-8969en_US
dc.identifier.urihttps://hdl.handle.net/1956/23578
dc.description.abstractA graph G is contractible to a graph H if there is a set X subseteq E(G), such that G/X is isomorphic to H. Here, G/X is the graph obtained from G by contracting all the edges in X. For a family of graphs F, the F-Contraction problem takes as input a graph G on n vertices, and the objective is to output the largest integer t, such that G is contractible to a graph H in F, where |V(H)|=t. When F is the family of paths, then the corresponding F-Contraction problem is called Path Contraction. The problem Path Contraction admits a simple algorithm running in time 2^n * n^{O(1)}. In spite of the deceptive simplicity of the problem, beating the 2^n * n^{O(1)} bound for Path Contraction seems quite challenging. In this paper, we design an exact exponential time algorithm for Path Contraction that runs in time 1.99987^n * n^{O(1)}. We also define a problem called 3-Disjoint Connected Subgraphs, and design an algorithm for it that runs in time 1.88^n * n^{O(1)}. The above algorithm is used as a sub-routine in our algorithm for Path Contraction.en_US
dc.language.isoengeng
dc.publisherDagstuhl Publishingen_US
dc.rightsAttribution CC BYeng
dc.rights.urihttp://creativecommons.org/licenses/by/3.0eng
dc.titlePath Contraction Faster Than 2nen_US
dc.typePeer reviewed
dc.typeJournal article
dc.date.updated2020-02-14T16:15:18Z
dc.description.versionpublishedVersionen_US
dc.rights.holderCopyright 2019 The Author(s)en_US
dc.identifier.doihttps://doi.org/10.4230/lipics.icalp.2019.11
dc.identifier.cristin1766805
dc.source.journalLeibniz International Proceedings in Informatics
dc.identifier.citationLeibniz International Proceedings in Informatics. 2019, 132.


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Attribution CC BY
Med mindre annet er angitt, så er denne innførselen lisensiert som Attribution CC BY