92 citations · 170 across the 35 of their papers we have counts for
Showing 2018 · cs.DCShow all
2 papers · 2 filters
cs.DC2018★ 3 cited
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Keren Censor-Hillel, Ami Paz, Noam Ravid
Spanners are fundamental graph structures that sparsify graphs at the cost of small stretch. In particular, in recent years, many sequential algorithms constructing additive all-pa…
cs.DC2018
Distributed Reconfiguration of Maximal Independent Sets
Keren Censor-Hillel, Mikaël Rabie
In this paper, we investigate a distributed maximal independent set (MIS) reconfiguration problem, in which there are two maximal independent sets for which every node is given its…