Pages that link to "Item:Q494801"
From MaRDI portal
The following pages link to \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801):
Displayed 11 items.
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Perfect forests in graphs and their extensions (Q6057643) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)