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

DOI10.1007/978-3-319-90530-3_21zbMATH Open1434.68747OpenAlexW2802413901MaRDI QIDQ1625174FDOQ1625174

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

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

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625174)