Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
type: Item
instance of: scholarly article
title: Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
zbMATH Open document ID: 1306.05181
DOI: 10.1137/130910932
author: Fedor V. Fomin
author: Petr A. Golovach
author: Daniel Lokshtanov
author: Saket Saurabh
published in: SIAM Journal on Computing
publication date: 2015-02-09T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6399468
zbMATH Keywords: exponential time hypothesis
zbMATH Keywords: clique-width
zbMATH Keywords: max-cut
zbMATH Keywords: edge dominating set
Wikidata QID: Q60488400
MaRDI profile type: Publication
OpenAlex ID: W1999145171
DBLP publication ID: journals/siamcomp/FominGLS14
Recommended article: Q5417642
Recommended article: On hardness of approximating the parameterized clique problem
Recommended article: Fast exact algorithms for some connectivity problems parameterized by clique-width
Recommended article: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Recommended article: Q4232773
Recommended article: Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
Recommended article: Linear time solvable optimization problems on graphs of bounded clique-width
Recommended article: On the approximability of clique and related maximization problems
Recommended article: Bounding clique-width via perfect graphs
Recommended article: Bounding Clique-Width via Perfect Graphs
description: scientific article; zbMATH DE number 6399468