Distributed Lower Bounds for Ruling Sets
Distributed Lower Bounds for Ruling Sets
Given a graph G=(V, E), an ( α,β) -ruling set is a subset S ⊆ V such that the distance between any two vertices in S is at least α, and the distance between any vertex in V and the closest vertex in S is at most β. We present …