![](/img/cover-not-exists.png)
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
Asaf Levin, Daniel Paulusma, Gerhard J. WoegingerVolume:
51
Year:
2008
Language:
english
Pages:
12
DOI:
10.1002/net.20214
File:
PDF, 371 KB
english, 2008