Doubly balanced connected graph partitioning

DOI10.1137/1.9781611974782.126MaRDI QIDQ6829514zbMATH OpenFDO

Authors Saleh Soltan, Mihalis Yannakakis, Gil Zussman

Publication date 16 July 2018

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

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

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Doubly balanced connected graph partitioning

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