Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound☆
Under an Elsevier user license
open archive
Keywords
Algorithms and data structures
Fixed-parameter tractable algorithms
Above-guarantee parameterization
Max-Cut
λ-extendible properties
Cited by (0)
- 1
Supported by the Indo-German Max Planck Center for Computer Science (IMPECS), Bundesministerium für Bildung und Forschung (BMBF) grant 01OA1001.
- 2
Part of this work was done while visiting the Max-Planck-Institut für Informatik, supported by IMPECS.
- 3
Part of this work was done while with the Saarland University, supported by the DFG Cluster of Excellence on Multimodal Computing and Interaction and the DFG project DARE (GU 1023/1-2), while at TU Berlin, supported by the DFG project AREG (NI 369/9), and while visiting the Institute of Mathematical Sciences, Chennai, supported by IMPECS.
Copyright © 2014 Elsevier Inc. All rights reserved.