Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.03.024 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.03.024 / rank | |||
Normal rank | |||
Latest revision as of 16:55, 18 December 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
0 references
0 references
0 references
