Pages that link to "Item:Q1799226"
From MaRDI portal
The following pages link to \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226):
Displaying 4 items.
- \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable (Q1625174) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- (Q4558957) (← links)
