Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
DOI10.1137/130910932zbMath1306.05181WikidataQ60488400 ScholiaQ60488400MaRDI QIDQ5173247
Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Daniel Lokshtanov
Publication date: 9 February 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c03e94ded9e205867e041aec76b06cf3e724df34
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
