Faster algorithms for vertex partitioning problems parameterized by clique-width
Work
Year: 2014
Type: article
Abstract: Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a k-expression, Dominating Set can be solved in 4knO(1) time. However, no ... more
Source: Theoretical Computer Science
Cites: 40
Cited by: 19
Related to: 10
FWCI: 2.276
Citation percentile (by year/subfield): 92.09
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,690
Funder Norges Forskningsråd