Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Faster algorithms for vertex partitioning problems parameterized by clique-width |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for vertex partitioning problems parameterized by clique-width |
scientific article |
Statements
Faster algorithms for vertex partitioning problems parameterized by clique-width (English)
0 references
29 April 2014
0 references
clique-width
0 references
parameterized complexity
0 references
dynamic programming
0 references
generalized domination
0 references
rank-width
0 references
0 references
0 references
0 references
