\textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable

DOI10.1007/978-3-319-90530-3_21zbMath1434.68747MaRDI QIDQ1625174

Meirav Zehavi, Saket Saurabh, Jayakrishnan Madathil

Publication date: 28 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_21

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization