Pages that link to "Item:Q2843252"
From MaRDI portal
The following pages link to Max-Cut Parameterized above the Edwards-Erdős Bound (Q2843252):
Displaying 17 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable (Q1625174) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound (Q2957517) (← links)
- Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound (Q2963896) (← links)
- Parameterizing above Guaranteed Values: MaxSat and MaxCut (Q4242660) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
