19 citations · 110 across the 50 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018
Congested Clique Algorithms for Graph Spanners
Merav Parter, Eylon Yogev
Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide rang…
cs.DS2018★ 14 cited
Coloring in the Congested Clique Model
Merav Parter
In this paper, we present improved algorithms for the (vertex) coloring problem in the Congested-Clique model of distributed computing. In this model, the input is a graph…
cs.DS2018
Wireless Expanders
Shirel Attali, Merav Parter, David Peleg +1
This paper introduces an extended notion of expansion suitable for radio networks. A graph is called an -{wireless expander} if for every subset $S \subseteq…