Solving some NP-complete problems using split decomposition (Q948695): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2007.11.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2007.11.013 / rank | |||
Normal rank | |||
Revision as of 09:26, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving some NP-complete problems using split decomposition |
scientific article |
Statements
Solving some NP-complete problems using split decomposition (English)
0 references
17 October 2008
0 references
graph algorithms
0 references
graph coloring
0 references
NP-complete problems
0 references
split decomposition
0 references
clique-width
0 references
0 references
