Low Congestion Cycle Covers and Their Applications

DOI10.1137/1.9781611975482.101zbMath1432.68367arXiv1812.04492OpenAlexW2950751105MaRDI QIDQ5236285

Eylon Yogev, Merav Parter

Publication date: 15 October 2019

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

Full work available at URL: https://arxiv.org/abs/1812.04492

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Distributed algorithms (68W15)

Related Items (3)

Invited talk: Resilient distributed algorithms ⋮ Distributed computations in fully-defective networks ⋮ Distributed CONGEST Algorithms against Mobile Adversaries

This page was built for publication: Low Congestion Cycle Covers and Their Applications