Pages that link to "Item:Q722541"
From MaRDI portal
The following pages link to Linear kernels and linear-time algorithms for finding large cuts (Q722541):
Displaying 12 items.
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable (Q1625174) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Max-Cut Parameterized above the Edwards-Erdős Bound (Q2843252) (← 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)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q5009482) (← links)
