Distributed connectivity decomposition
Publication:2943618
DOI10.1145/2611462.2611491zbMath1321.68459arXiv1304.4553MaRDI QIDQ2943618
Keren Censor-Hillel, Fabian Kuhn, Mohsen Ghaffari
Publication date: 3 September 2015
Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.4553
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68M14: Distributed systems
05C40: Connectivity
68W15: Distributed algorithms
Related Items