Minimum bisection is fixed-parameter tractable
From MaRDI portal
Recommendations
- Minimum bisection is fixed parameter tractable
- On the parameterized complexity of computing graph bisections
- Bisections above Tight Lower Bounds
- On minimum bisection and related partition problems in graphs with bounded tree width
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
Cites work
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 1870231 (Why is no real title available?)
- A Menger-like property of tree-width: The finite case
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A polylogarithmic approximation of the minimum bisection
- An improved parameterized algorithm for the minimum node multiway cut problem
- Approximating the minimum bisection size (extended abstract)
- Color-coding
- Connectivity and tree structure in finite graphs
- Designing FPT algorithms for cut problems using randomized contractions
- Finding small balanced separators
- Finding small separators in linear time via treewidth reduction
- Finding topological subgraphs is fixed-parameter tractable
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Graph minors. XIII: The disjoint paths problem
- Minimum bisection is fixed parameter tractable
- On the parameterized complexity of computing balanced partitions in graphs
- On the parameterized complexity of computing graph bisections
- Parameterized graph separation problems
- Partitioning Planar Graphs
- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- The minimum \(k\)-way cut of bounded size is fixed-parameter tractable
- The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into \(\ell_1\)
Cited in
(23)- A polylogarithmic approximation of the minimum bisection
- On the parameterized complexity of computing graph bisections
- Model checking disjoint-paths logic on topological-minor-free graph classes
- On minimum bisection and related cut problems in trees and tree-like graphs
- Compound logics for modification problems
- Flow-augmentation. II: Undirected graphs
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
- Approximating the minimum bisection size (extended abstract)
- A survey of parameterized algorithms and the complexity of edge modification
- Exploiting dense structures in parameterized complexity
- On minimum bisection and related partition problems in graphs with bounded tree width
- Breaking a graph into connected components with small dominating sets
- Equitable connected partition and structural parameters revisited: N-fold beats Lenstra
- Minimum bisection is NP-hard on unit disk graphs
- Flow-augmentation. I: Directed graphs
- First-order Logic with Connectivity Operators
- Bisection of bounded treewidth graphs by convolutions
- Minimum bisection is fixed parameter tractable
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Finding connected secluded subgraphs
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
This page was built for publication: Minimum bisection is fixed-parameter tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634024)
