"(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time ..."

Saket Saurabh, Meirav Zehavi (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-662-49529-2_51

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/SaurabhZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/SaurabhZ16
Saket Saurabh, Meirav Zehavi:
(k, n-k)-Max-Cut: An 𝒪^∗(2^p)-Time Algorithm and a Polynomial Kernel. LATIN 2016: 686-699

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.