Non-uniform graph partitioning

DOI10.1137/1.9781611973402.91MaRDI QIDQ5384053zbMATH OpenOpenAlexFDO

Authors Robert Krauthgamer, Joseph (Seffi) Naor, Roy Schwartz, Kunal Talwar

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.91

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Nonuniform graph partitioning with unrelated weights
• Minimum nonuniform graph partitioning with unrelated weights
• Balanced graph partitioning
• Partitioning graphs into balanced components
• Multiply balanced k-partitioning

Cited in

(2)

• Minimum nonuniform graph partitioning with unrelated weights
• Nonuniform graph partitioning with unrelated weights

This page was built for publication: Non-uniform graph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384053)