The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648)
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: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases |
scientific article |
Statements
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (English)
0 references
20 June 2008
0 references
graph
0 references
edge contraction
0 references
dominating vertex
0 references
computational complexity
0 references
0 references
