Balanced judicious bipartition is fixed-parameter tractable
From MaRDI portal
Publication:5136332
Recommendations
Cites work
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- An improved parameterized algorithm for the minimum node multiway cut problem
- Balanced judicious bipartitions of graphs
- Bisections above Tight Lower Bounds
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- Designing FPT algorithms for cut problems using randomized contractions
- Exact bounds for judicious partitions of graphs
- Faster parameterized algorithms using linear programming
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Judicious \(k\)-partitions of graphs
- Judicious partitions and related problems
- Judicious partitions of 3-uniform hypergraphs
- Judicious partitions of bounded‐degree graphs
- Judicious partitions of directed graphs
- Judicious partitions of graphs
- Judicious partitions of hypergraphs
- Judicious partitions of uniform hypergraphs
- Linear kernels and linear-time algorithms for finding large cuts
- Max \(k\)-cut and judicious \(k\)-partitions
- Maximum balanced subgraph problem parameterized above lower bound
- Maximum cuts and judicious partitions in graphs without short cycles
- Minimum bisection is fixed parameter tractable
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- Note on maximal bisection above tight lower bound
- On judicious bipartitions of graphs
- On judicious bisections of graphs
- Parameterized algorithms for load coloring problem
- Parameterized and approximation algorithms for the load coloring problem
- Parameterized graph separation problems
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parameterizing above or below guaranteed values
- Problems and results on judicious partitions
- Representative families: a unified tradeoff-based approach
- Some Extremal Properties of Bipartite Subgraphs
- The minimum \(k\)-way cut of bounded size is fixed-parameter tractable
- \((k,n-k)\)-max-cut: an \({\mathcal O}^*(2^p)\)-time algorithm and a polynomial kernel
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
Cited in
(6)- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
- Parameterized complexity of multi-node hubs
- An improved kernel for max-bisection above tight lower bound
- Brief announcement: Bounded-degree cut is fixed-parameter tractable
- Parameterized complexity of multi-node hubs
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
This page was built for publication: Balanced judicious bipartition is fixed-parameter tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136332)
