A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482)

From MaRDI portal
Revision as of 04:07, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    1 December 2015
    0 references
    graph algorithms
    0 references
    \(k\)-hop dominating set
    0 references
    rooted tree
    0 references

    Identifiers