Distributed connectivity decomposition

DOI10.1145/2611462.2611491MaRDI QIDQ6829055zbMATH OpenFDO

Authors Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn

Publication date 3 September 2015

Published in Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2611462.2611491

zbMATH Keywords

decompositiondistributed algorithmgraph connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited in

(4)

• On packing low-diameter spanning trees
• Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
• Distributed model checking on graphs of bounded treedepth
• Vertex connectivity in poly-logarithmic max-flows

This page was built for publication: Distributed connectivity decomposition

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