Computing Minimum Weight Cycle in the CONGEST Model-Reference-Cited by-同舟云学术

Computing Minimum Weight Cycle in the CONGEST Model

Published:2024-06-17 Issue: Volume:42 Page:182-193
ISSN:
Container-title:Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Manoharan Vignesh¹^ORCID,Ramachandran Vijaya²^ORCID

Affiliation:

1. Department of Computer Science, The University of Texas Austin, Austin, TX, USA

2. Department of Computer Science, The University of Texas Austin, Austin, TX, United States of America

Funder

National Science Foundation

Publisher

ACM

Reference48 articles.

1. Amir Abboud, Keren Censor-Hillel, and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In Distributed Computing - 30th International Symposium, DISC 2016 (Lecture Notes in Computer Science, Vol. 9888). Springer, Paris, France, 29--42.

2. Amir Abboud, Virginia Vassilevska Williams, and Joshua R. Wang. 2016. Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. SIAM, Arlington, VA, USA, 377--391.

3. Udit Agarwal and Vijaya Ramachandran. 2018. Fine-grained complexity for sparse graphs. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018. ACM, Los Angeles, CA, USA, 239--252.

4. Udit Agarwal and Vijaya Ramachandran. 2019. Distributed Weighted All Pairs Shortest Paths Through Pipelining. In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019. IEEE, Rio de Janeiro, Brazil, 23--32.

5. Udit Agarwal and Vijaya Ramachandran. 2020. Faster Deterministic All Pairs Shortest Paths in Congest Model. In SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. ACM, Virtual Event, USA, 11--21.