Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

This paper presents new deterministic and distributed low-diameter decomposition algorithms for weighted graphs. In particular, we show that if one can efficiently compute approximate distances in a parallel or a distributed setting, one can also efficiently compute low-diameter decompositions. This...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 1114 - 1121
Hlavní autori:	Rozhon, Vaclav, Elkin, Michael, Grunau, Christoph, Haeupler, Bernhard
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2022
Predmet:	Approximation algorithms Clustering algorithms Complexity theory Computational modeling Computer science Distortion Parallel algorithms
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!