Pages that link to "Item:Q5200505"
From MaRDI portal
The following pages link to Bisections above Tight Lower Bounds (Q5200505):
Displaying 12 items.
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Bisection hardly ever converges linearly (Q1347031) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- A polylogarithmic approximation of the minimum bisection (Q2784494) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← 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)