Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
From MaRDI portal
Recommendations
- Multi-way graph partition by stochastic probe
- scientific article; zbMATH DE number 1310280
- scientific article; zbMATH DE number 1034105
- Expected complexity of graph partitioning problems
- Multicommodity flow approximation used for exact graph partitioning
- scientific article; zbMATH DE number 4011955
- scientific article; zbMATH DE number 1942408
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Approximate hypergraph partitioning and applications
Cites work
- scientific article; zbMATH DE number 637304 (Why is no real title available?)
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Approximation algorithms for maximum cut with limited unbalance
- Balanced judicious bipartitions of graphs
- Better bounds for \(k\)-partitions of graphs
- Bounds for pairs in partitions of graphs
- Exact bounds for judicious partitions of graphs
- Improved approximations for max set splitting and max NAE SAT
- Judicious \(k\)-partitions of graphs
- Judicious partitions of hypergraphs
- On a bottleneck bipartition conjecture of Erdős
- On several partitioning problems of Bollobás and Scott
- Partitioning 3-uniform hypergraphs
- Problems and results on judicious partitions
- Segmentation problems
This page was built for publication: Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714518)
