A linear time algorithm for optimal k -hop dominating set of a tree

Basuchowdhuri, 2014, Finding influential nodes in social networks using minimum k-hop dominating set, 136 Cockayne, 1975, A linear algorithm for the domination number of a tree, Inf. Process. Lett., 4, 41, 10.1016/0020-0190(75)90011-3 Demaine, 2005, Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs, ACM Trans. Algorithms, 1, 1, 10.1145/1077464.1077468 Garey, 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, vol. 190 Harary, 2000, Double domination in graphs, Ars Comb., 55, 201 Haynes, 1998 1998 Henning, 1991, Bounds on distance domination parameters, J. Comb. Inf. Syst. Sci., 16, 11 Lan, 2013, Algorithmic aspects of the k-domination problem in graphs, Discrete Appl. Math., 161, 1513, 10.1016/j.dam.2013.01.015 Slater, 1976, R-domination in graphs, J. ACM, 23, 446, 10.1145/321958.321964