A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A linear algorithm for the domination number of a tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552196 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4029974 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic aspects of the \(k\)-domination problem in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: <i>R</i> -Domination in Graphs / rank | |||
Normal rank |
Latest revision as of 03:07, 11 July 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