Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
From MaRDI portal
Publication:714518
DOI10.1016/J.AML.2012.04.015zbMATH Open1251.05144OpenAlexW2062775464MaRDI QIDQ714518FDOQ714518
Authors: Fang Tian, Zi-Long Liu 
Publication date: 11 October 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2012.04.015
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
- Judicious partitions of hypergraphs
- Exact bounds for judicious partitions of graphs
- Problems and results on judicious partitions
- On several partitioning problems of Bollobás and Scott
- Partitioning 3-uniform hypergraphs
- Judicious \(k\)-partitions of graphs
- Title not available (Why is that?)
- Better bounds for \(k\)-partitions of graphs
- Balanced judicious bipartitions of graphs
- On a bottleneck bipartition conjecture of Erdős
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Segmentation problems
- Improved approximations for max set splitting and max NAE SAT
- Approximation algorithms for maximum cut with limited unbalance
- Bounds for pairs in partitions of graphs
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)
