A Polylogarithmic Approximation of the Minimum Bisection
From MaRDI portal
Recommendations
Cited in
(23)- On cutting a few vertices from a graph
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- Improved analysis of online balanced clustering
- Competitive clustering of stochastic communication patterns on a ring
- Complexity of the bisection method
- Partition-based logical reasoning for first-order and propositional theories
- Unbalanced graph cuts with minimum capacity
- Continuum limit of total variation on point clouds
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- A polylogarithmic approximation of the minimum bisection
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- A polynomial-time bicriteria approximation scheme for planar bisection
- On the maximal error of spectral approximation of graph bisection
- Approximating the minimum bisection size (extended abstract)
- Community detection and stochastic block models: recent developments
- scientific article; zbMATH DE number 1929926 (Why is no real title available?)
- Dynamic balanced graph partitioning
- Bisections above Tight Lower Bounds
- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
- Fission: Practical algorithms for computing minimum balanced node separators
- A subquadratic bound for online bisection
- Improved bounds for online balanced graph re-partitioning
This page was built for publication: A Polylogarithmic Approximation of the Minimum Bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470837)
