Deterministic Distributed Ruling Sets of Line Graphs

An (α, β)-ruling set of a graph G = (V,E) is a set R ⊆ V such that for any node v ∈ V there is a node u ∈ R in distance at most β from v and such that any two nodes in R are at distance at least α from each other. The concept of ruling sets can naturally be extended to edges, i.e., a subset F ⊆ E is an (α, β)-ruling edge set of a graph G = (V,E) if the… CONTINUE READING