(k,n-k)-max-cut: an O^*(2p)-time algorithm and a polynomial kernel
From MaRDI portal
Publication:2802978
Recommendations
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
- Max-Cut parameterized above the Edwards-Erdős bound
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree}
Cited in
(14)- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
- Parameterized complexity of multi-node hubs
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree}
- A new kernel for parameterized Max-Bisection above tight lower bound
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT
- scientific article; zbMATH DE number 6987353 (Why is no real title available?)
- Parameterized complexity of multi-node hubs
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
- Fast Distributed Approximation for Max-Cut
- Balanced judicious bipartition is fixed-parameter tractable
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Exact and Parameterized Algorithms for the Independent Cutset Problem
- Exact and parameterized algorithms for the independent cutset problem
This page was built for publication: \((k,n-k)\)-max-cut: an \({\mathcal O}^*(2^p)\)-time algorithm and a polynomial kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802978)
