Tight complexity bounds for FPT subgraph problems parameterized by the clique-width

DOI10.1016/j.tcs.2013.03.008zbMath1297.05163MaRDI QIDQ388791

Petr A. Golovach, Viresh Patel, Hajo J. Broersma

Publication date: 7 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.008

zbMATH Keywords

clique-width; parameterized complexity; exponential time hypothesis

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)