A distributed algorithm for minimum distance-k domination in trees

Volker Turau, Sven Köhler

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


While 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.

Original languageEnglish
Pages (from-to)223-242
Number of pages20
JournalJournal of Graph Algorithms and Applications
Issue number1
StatePublished - 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2015, Brown University. All rights reserved.


Dive into the research topics of 'A distributed algorithm for minimum distance-k domination in trees'. Together they form a unique fingerprint.

Cite this