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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Science China. Information sciences Ročník 64; číslo 11; s. 212101
Hlavní autori:	Hua, Qiang-Sheng, Qian, Lixiang, Yu, Dongxiao, Shi, Xuanhua, Jin, Hai
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Beijing Science China Press 01.11.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!