The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20214 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4234850175 / rank | |||
Normal rank | |||
Revision as of 19:00, 19 March 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
