4 citations · 4 across the 1 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2023
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
Leonid Barenboim, Uri Goldenberg
We obtain improved distributed algorithms in the CONGEST message-passing setting for problems on power graphs of an input graph . This includes Coloring, Maximal Independent Set…
cs.DC2017★ 4 cited
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models
Leonid Barenboim, Michael Elkin, Uri Goldenberg
We consider graph coloring and related problems in the distributed message-passing model. {Locally-iterative algorithms} are especially important in this setting. These are algorit…