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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Science China. Information sciences Jg. 64; H. 11; S. 212101
Hauptverfasser:	Hua, Qiang-Sheng, Qian, Lixiang, Yu, Dongxiao, Shi, Xuanhua, Jin, Hai
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Beijing Science China Press 01.11.2021 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!