.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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).
Keyword:
distributed algorithms
weighted girth
CONGEST model
communication complexity
round complex
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
A previously undescribed highly prevalent phage identified in a Danish enteric virome catalogue.png)
IF0
PREAI
分享收藏Multiple Polypeptide Hormone Expression in Pancreatic Islet Cell Carcinomas Derived from Phosphoenolpyruvatecarboxykinase-SV40 T Antigen Transgenic RatsPancreas
PancreasIF0
PREAI
分享收藏
查看更多内容