Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars

A distance-k dominating set D of a directed graph G is a set of vertices such that for every vertex v of G, there is a vertex u ∈ D and the distance between u and v is at most k. Minimum distance-k...