A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time algorithm for optimal k-hop dominating set of a tree |
scientific article; zbMATH DE number 6515024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for optimal \(k\)-hop dominating set of a tree |
scientific article; zbMATH DE number 6515024 |
Statements
A linear time algorithm for optimal \(k\)-hop dominating set of a tree (English)
0 references
1 December 2015
0 references
graph algorithms
0 references
\(k\)-hop dominating set
0 references
rooted tree
0 references
0 references
0.92586327
0 references
0.90955853
0 references
0.9053883
0 references
0.90492463
0 references
0.8958089
0 references
0.8931205
0 references
0.8916489
0 references
0 references
