A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1149456426 / rank | |||
Normal rank | |||
Revision as of 22:20, 19 March 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
