A Distributed Algorithm for Minimum Distance-k Domination in Trees

DOI10.7155/JGAA.00354zbMath1310.05081OpenAlexW2035705309MaRDI QIDQ5246713

Volker Turau, Sven Köhler

Publication date: 22 April 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00354

zbMATH Keywords

distributed algorithmdistance-\(k\) dominating sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Related Items (1)

Distance Domination in Graphs

This page was built for publication: A Distributed Algorithm for Minimum Distance-k Domination in Trees