Turau, VolkerVolkerTurauKöhler, SvenSvenKöhler2020-06-232020-06-232015-03Journal of Graph Algorithms and Applications 1 (19): 223-242 (2015)http://hdl.handle.net/11420/6393While efficient algorithms for finding minimal distance-k dominating sets exist, finding minimum such sets is NP-hard even for bipartite graphs. This paper presents a distributed algorithm to determine a minimum (connected) distance-k dominating set and a maximum distance-2k independent set of a tree T. It terminates in O(height(T)) rounds and uses O(log k) space. To the best of our knowledge this is the first distributed algorithm that computes a minimum (as opposed to a minimal) distanced dominating set for trees. The algorithm can also be applied to general graphs, albeit the distance-k dominating sets are not necessarily minimal.en1526-171920151223242JGAAInformatikJournal Article10.7155/jgaa.00354Journal Article