Fingerprint
Dive into the research topics of 'The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
A. Levin, D. Paulusma, G.J. Woeginger
Research output: Contribution to journal › Article › Academic › peer-review
28
Citations
(Scopus)
2
Downloads
(Pure)