"$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( ..."

Saket Saurabh, Meirav Zehavi (2018)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0418-5

access: closed

type: Journal Article

metadata version: 2018-10-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/SaurabhZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/SaurabhZ18
Saket Saurabh, Meirav Zehavi:
$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Algorithmica 80(12): 3844-3860 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.