Tight Lower Bounds for Problems Parameterized by Rank-Width

DSpace/Manakin Repository

Tight Lower Bounds for Problems Parameterized by Rank-Width
 
Bergougnoux, Benjamin; Korhonen, Tuukka; Nederlof, Jesper
(2023)
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, volume 254, pp. 11:1 - 11:17
Leibniz International Proceedings in Informatics, LIPIcs, volume 254, pp. 11:1 - 11:17
(Part of book)
Abstract
We show that there is no 2o(k2)nO(1) time algorithm for Independent Set on n-vertex graphs with rank-width k, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the 2O(k2)nO(1) time algorithm given by Bui-Xuan, Telle, and Vatshelle [Discret. Appl. Math., 2010] and it answers the open question of ... read more
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: Boolean-width, dominating set, exponential time hypothesis, feedback vertex set, independent set, maximum induced matching, parameterized algorithms, rank-width, Software
DOI: https://doi.org/10.4230/LIPIcs.STACS.2023.11
ISSN: 1868-8969
ISBN: 9783959772662
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
Note: Funding Information: Funding Tuukka Korhonen: Supported by the Research Council of Norway via the project BWCA (grant no. 314528). Jesper Nederlof : Supported by the project CRACKNP that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 853234). Funding Information: Funding Tuukka Korhonen: Supported by the Research Council of Norway via the project BWCA (grant no. 314528). Jesper Nederlof: Supported by the project CRACKNP that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation pro-gramme (grant agreement No 853234). Publisher Copyright: © Benjamin Bergougnoux, Tuukka Korhonen, and Jesper Nederlof.
(Peer reviewed)
 
 
See more statistics about this item