A nearly optimal distributed algorithm for computing the weighted girth

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...

Full description

Saved in:

Bibliographic Details
Published in:	Science China. Information sciences Vol. 64; no. 11; p. 212101
Main Authors:	Hua, Qiang-Sheng, Qian, Lixiang, Yu, Dongxiao, Shi, Xuanhua, Jin, Hai
Format:	Journal Article
Language:	English
Published:	Beijing Science China Press 01.11.2021 Springer Nature B.V
Subjects:	Algorithms Apexes Computation Computer Science Graphs Information Systems and Communication Service Lower bounds Minimum weight Network analysis Research Paper Upper bounds weighted girth model communication complexity round complexity distributed algorithms
ISSN:	1674-733X, 1869-1919
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!