(k, n- k) -Max-Cut: An O(2 p) -Time Algorithm and a Polynomial Kernel

Saket Saurabh, Meirav Zehavi

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Fingerprint

Dive into the research topics of '(k, n- k) -Max-Cut: An O(2 p) -Time Algorithm and a Polynomial Kernel'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science