TY - GEN

T1 - Cliquewidth III

T2 - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

AU - Golovach, Petr A.

AU - Lokshtanov, Daniel

AU - Saurabh, Saket

AU - Zehavi, Meirav

N1 - Publisher Copyright: © Copyright 2018 by SIAM.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Max-Cut (MC), Edge Dominating Set (EDS), Graph Coloring (GC) and Hamiltonian Path (HP) on graphs of bounded cliquewidth have received significant attention as they can be formulated in MSO2 (and therefore have linear-time algorithms on bounded treewidth graphs by the celebrated Courcelle's theorem), but cannot be formulated in MSO1 (which would have yielded linear-time algorithms on bounded cliquewidth graphs by a well-known theorem of Courcelle, Makowsky, and Rotics). Each of these problems can be solved in time g(k)nf(k) on graphs of cliquewidth k. Fomin et al. [Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)] showed that the running times cannot be improved to g(k)nO(1) assuming W[1]6=FPT. However, this does not rule out nontrivial improvements to the exponent f(k) in the running times. In a follow-up paper, Fomin et al. [Almost Optimal Lower Bounds for Problems Parameterized by CliqueWidth. SIAM J. Comput. 43(5): 1541-1563 (2014)] improved the running times for EDS and MC to nO(k), and proved g(k)no(k) lower bounds for EDS, MC and HP assuming the ETH. Recently, Bergougnoux, Kante and Kwon [WADS 2017] gave an nO(k)-time algorithm for HP. Thus, prior to this work, EDS, MC and HP were known to have tight n ⊖(k) algorithmic upper and lower bounds. In contrast, GC has an upper bound of nO(2k) and a lower bound of merely no( 4 p k) (implicit from the W[1]-hardness proof). In this paper, we close the gap for GC by proving a lower bound of n2o(k). This shows that GC behaves qualitatively different from the other three problems. To the best of our knowledge, GC is the first natural problem known to require exponential dependence on the parameter in the exponent of n.

AB - Max-Cut (MC), Edge Dominating Set (EDS), Graph Coloring (GC) and Hamiltonian Path (HP) on graphs of bounded cliquewidth have received significant attention as they can be formulated in MSO2 (and therefore have linear-time algorithms on bounded treewidth graphs by the celebrated Courcelle's theorem), but cannot be formulated in MSO1 (which would have yielded linear-time algorithms on bounded cliquewidth graphs by a well-known theorem of Courcelle, Makowsky, and Rotics). Each of these problems can be solved in time g(k)nf(k) on graphs of cliquewidth k. Fomin et al. [Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)] showed that the running times cannot be improved to g(k)nO(1) assuming W[1]6=FPT. However, this does not rule out nontrivial improvements to the exponent f(k) in the running times. In a follow-up paper, Fomin et al. [Almost Optimal Lower Bounds for Problems Parameterized by CliqueWidth. SIAM J. Comput. 43(5): 1541-1563 (2014)] improved the running times for EDS and MC to nO(k), and proved g(k)no(k) lower bounds for EDS, MC and HP assuming the ETH. Recently, Bergougnoux, Kante and Kwon [WADS 2017] gave an nO(k)-time algorithm for HP. Thus, prior to this work, EDS, MC and HP were known to have tight n ⊖(k) algorithmic upper and lower bounds. In contrast, GC has an upper bound of nO(2k) and a lower bound of merely no( 4 p k) (implicit from the W[1]-hardness proof). In this paper, we close the gap for GC by proving a lower bound of n2o(k). This shows that GC behaves qualitatively different from the other three problems. To the best of our knowledge, GC is the first natural problem known to require exponential dependence on the parameter in the exponent of n.

UR - http://www.scopus.com/inward/record.url?scp=85045580550&partnerID=8YFLogxK

U2 - https://doi.org/10.1137/1.9781611975031.19

DO - https://doi.org/10.1137/1.9781611975031.19

M3 - Conference contribution

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 262

EP - 273

BT - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

A2 - Czumaj, Artur

Y2 - 7 January 2018 through 10 January 2018

ER -