A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2015.07.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2015.07.014 / rank | |||
Normal rank | |||
Latest revision as of 07:31, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for optimal \(k\)-hop dominating set of a tree |
scientific article |
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
