A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree

DOI10.1016/J.IPL.2017.10.009zbMath1421.05087OpenAlexW2765819298MaRDI QIDQ1679914

Sukhamay Kundu

Publication date: 22 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.10.009

zbMATH Keywords

algorithmsweighted tree\(k\)-distance dominating set

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• A linear algorithm for the domination number of a tree
• Algorithmic aspects of the \(k\)-domination problem in graphs
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• R -Domination in Graphs

This page was built for publication: A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree