Sciweavers

Share
NETWORKS
2008

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

10 years 2 months ago
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
Asaf Levin, Daniël Paulusma, Gerhard J. Woegi
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where NETWORKS
Authors Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
Comments (0)
books