A new deterministic CONGEST algorithm builds network decompositions of graph powers with 2^{O(sqrt(log n))} parameters, yielding faster distributed MIS, spanner, dominating set, and neighborhood cover algorithms.
Fast distributed network decompositions and covers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond
A new deterministic CONGEST algorithm builds network decompositions of graph powers with 2^{O(sqrt(log n))} parameters, yielding faster distributed MIS, spanner, dominating set, and neighborhood cover algorithms.