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

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

Saket Saurabh, Jayakrishnan Madathil, Meirav Zehavi

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

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment

This page was built for publication: \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable