Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:31, 2 February 2024
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
