A linear time algorithm for optimal \(k\)-hop dominating set of a tree
type: Item
instance of: scholarly article
title: A linear time algorithm for optimal \(k\)-hop dominating set of a tree
zbMATH Open document ID: 1346.05285
author: Sukhamay Kundu
author: Subhashis Majumder
published in: Information Processing Letters
publication date: 2015-12-01T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6515024
zbMATH Keywords: graph algorithms
zbMATH Keywords: \(k\)-hop dominating set
zbMATH Keywords: rooted tree
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.07.014
OpenAlex ID: W1149456426
cites work: A linear algorithm for the domination number of a tree
cites work: Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
cites work: Q4198056
cites work: Q4552196
cites work: Q4368728
cites work: Q4368729
cites work: Q4029974
cites work: Algorithmic aspects of the \(k\)-domination problem in graphs
cites work: R -Domination in Graphs
DOI: 10.1016/J.IPL.2015.07.014
Recommended article: A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
Recommended article: Q3728039
Recommended article: A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
Recommended article: A linear‐time algorithm for broadcast domination in a tree
Recommended article: Q5500103
Recommended article: A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
Recommended article: Approximating \(k\)-hop minimum-spanning trees
Recommended article: A linear time algorithm for minimum equitable dominating set in trees
Recommended article: Q5443202
Recommended article: An optimal algorithm to find minimum k-hop dominating set of interval graphs
description: scientific article; zbMATH DE number 6515024