dc.contributor.author | Cygan, Marek | eng |
dc.contributor.author | Pilipczuk, Marcin | eng |
dc.contributor.author | Pilipczuk, Michal Pawel | eng |
dc.contributor.author | Wojtaszczyk, Jakub Onufry | eng |
dc.date.accessioned | 2015-03-12T08:53:41Z | |
dc.date.available | 2015-03-12T08:53:41Z | |
dc.date.issued | 2014-10 | eng |
dc.identifier.issn | 0178-4617 | en_US |
dc.identifier.uri | https://hdl.handle.net/1956/9519 | |
dc.description.abstract | The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected subgraphs. While the naive algorithm runs in O(2nnO(1)) time, solutions with complexity of form O((2 − ε)n) have been found only for special graph classes (van ’t Hof et al. in Theor. Comput. Sci. 410(47–49):4834–4843, 2009; Paulusma and van Rooij in Theor. Comput. Sci. 412(48):6761–6769, 2011). In this paper we present an O(1.933n) algorithm for 2-DISJOINT CONNECTED SUBGRAPHS in general case, thus breaking the 2n barrier. As a counterpoise of this result we show that if we parameterize the problem by the number of non-terminal vertices, it is hard both to speed up the brute-force approach and to find a polynomial kernel. | en_US |
dc.language.iso | eng | eng |
dc.publisher | Springer | en_US |
dc.rights | Attribution CC BY | eng |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0 | eng |
dc.subject | Exact algorithms | eng |
dc.subject | 2ⁿ barrier | eng |
dc.subject | 2-Disjoint Connected Subgraphs | eng |
dc.subject | Kernelization | eng |
dc.subject | Exponential Time Hypothesis | eng |
dc.title | Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ | en_US |
dc.type | Peer reviewed | |
dc.type | Journal article | |
dc.date.updated | 2015-03-05T09:14:20Z | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2013 The Authors | en_US |
dc.identifier.doi | https://doi.org/10.1007/s00453-013-9796-x | |
dc.identifier.cristin | 1069483 | |
dc.source.journal | Algorithmica | |
dc.source.40 | 70 | |
dc.source.14 | 2 | |
dc.source.pagenumber | 195-207 | |
dc.subject.nsi | VDP::Mathematics and natural scienses: 400::Information and communication science: 420::Algorithms and computability theory: 422 | en_US |
dc.subject.nsi | VDP::Matematikk og naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Algoritmer og beregnbarhetsteori: 422 | nob |