Girth Approximations in the CONGEST Model
Open Access
- 6 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 14-24
Abstract
No abstract availableAll Related Versions
This publication has 16 references indexed in Scilit:
- Optimal Girth Approximation for Dense Directed Graphs2021
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming ModelsSIAM Journal on Computing, 2021
- Distributed distance computation and routing with small messagesDistributed Computing, 2018
- Networks Cannot Compute Their Diameter in Sublinear Time2012
- Distributed Computing: A Locality-Sensitive Approach2000
- A new series of dense graphs of high girthBulletin of the American Mathematical Society, 1995
- On the distributional complexity of disjointnessTheoretical Computer Science, 1992
- The Probabilistic Communication Complexity of Set IntersectionSIAM Journal on Discrete Mathematics, 1992
- Compactness results in extremal graph theoryCombinatorica, 1982
- Cycles of even length in graphsJournal of Combinatorial Theory, Series B, 1974