The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.20214 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.20214 / rank | |||
Normal rank | |||
Latest revision as of 09:50, 21 December 2024
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
