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

A. Levin, D. Paulusma, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

24 Citations (Scopus)
1 Downloads (Pure)

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.

Engineering & Materials Science