This is the authors' abstract. We don't add key points for this paper.
Network decompositions, as introduced by Awerbuch, Luby, Goldberg, and [FOCS'89], are one of the key algorithmic tools in distributed graph. We present an improved deterministic distributed algorithm for network decompositions of power graphs using small messages, which upon the algorithm of Ghaffari and Kuhn [DISC'18]. In addition, we a randomized distributed network decomposition algorithm, based on our algorithm, with failure probability exponentially small in the size that works with small messages as well. Compared to the previous of Elkin and Neiman [PODC'16], our algorithm achieves a better probability at the expense of its round complexity, while giving a decomposition of the same quality. As a consequence of the randomized for network decomposition, we get a faster randomized algorithm for a Maximal Independent Set, improving on a result of Ghaffari[SODA'19]. Other implications of our improved deterministic network algorithm are: a faster deterministic distributed algorithms for spanners and approximations of distributed set cover, improving of Ghaffari, and Kuhn [DISC'18] and Deurer, Kuhn, and Maus [PODC'19]; faster a deterministic distributed algorithm for constructing neighborhood, resolving an open question of Elkin [SODA'04].
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ghaffari et al. (2019) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: