$$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel
Crossref DOI link: https://doi.org/10.1007/s00453-018-0418-5
Published Online: 2018-02-20
Published Print: 2018-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Saurabh, Saket
Zehavi, Meirav
Text and Data Mining valid from 2018-02-20
Article History
Received: 15 March 2016
Accepted: 9 February 2018
First Online: 20 February 2018