A linear time algorithm for optimal \(k\)-hop dominating set of a tree
From MaRDI portal
Publication:894482
DOI10.1016/J.IPL.2015.07.014zbMath1346.05285OpenAlexW1149456426MaRDI QIDQ894482
Sukhamay Kundu, Subhashis Majumder
Publication date: 1 December 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.014
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph ⋮ A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree ⋮ Relationship between optimal \(k\)-distance dominating sets in a weighted graph and its spanning trees ⋮ COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES ⋮ Unnamed Item ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ Algorithm and hardness results on hop domination in graphs
Cites Work
This page was built for publication: A linear time algorithm for optimal \(k\)-hop dominating set of a tree