Bisection of bounded treewidth graphs by convolutions
From MaRDI portal
Publication:5075784
Recommendations
- Bisection of bounded treewidth graphs by convolutions
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
- On minimum bisection and related partition problems in graphs with bounded tree width
- Solving cut-problems in quadratic time for graphs with bounded treewidth
- On minimum bisection and related cut problems in trees and tree-like graphs
Cites work
- scientific article; zbMATH DE number 1688377 (Why is no real title available?)
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A \(c^k n\) 5-approximation algorithm for treewidth
- A parallel algorithm for bisection width in trees
- A polylogarithmic approximation of the minimum bisection
- Approximating the minimum bisection size (extended abstract)
- Better approximations for tree sparsity in nearly-linear time
- Clustered Integer 3SUM via Additive Combinatorics
- Minimum bisection is fixed parameter tractable
- On problems equivalent to \((\min,+)\)-convolution
- On some fine-grained questions in algorithms and complexity
- On the parameterized complexity of computing graph bisections
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Partitioning Planar Graphs
- Subcubic equivalences between path, matrix, and triangle problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into \(\ell_1\)
- Treewidth. Computations and approximations
Cited in
(3)
This page was built for publication: Bisection of bounded treewidth graphs by convolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075784)
