Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 09:16, 5 March 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
