Max-Cut Parameterized above the Edwards-Erdős Bound
From MaRDI portal
Publication:2843252
DOI10.1007/978-3-642-31594-7_21zbMath1272.68151OpenAlexW2100048208MaRDI QIDQ2843252
No author found.
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_21
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Maximum balanced subgraph problem parameterized above lower bound ⋮ Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ Parameterized Traveling Salesman Problem: Beating the Average ⋮ Large Independent Sets in Subquartic Planar Graphs ⋮ Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} ⋮ Parameterizations of test cover with bounded test sizes
This page was built for publication: Max-Cut Parameterized above the Edwards-Erdős Bound
