.png){kind=icon}
.png){kind=icon}
Return
A nearly optimal distributed algorithm for computing the weighted girth
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-020-2931-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle, is an important. problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, n(c)], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CONGEST model, which limits each vertex can only transfer O(logn) bits information along each incident edge in a round. The upper bound of the algorithm is O(n log(2) n) rounds. We also prove the lower bound for computing the weighted girth is Omega(D+n/log n) where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O(log(3) n).
Keywords:
distributed algorithms
weighted girth
CONGEST model
communication complexity
round complex
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K