Algorithm and hardness results on hop domination in graphs (Q2338219)

From MaRDI portal
Revision as of 02:01, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithm and hardness results on hop domination in graphs
scientific article

    Statements

    Algorithm and hardness results on hop domination in graphs (English)
    0 references
    0 references
    21 November 2019
    0 references
    domination
    0 references
    hop domination
    0 references
    polynomial-time algorithm
    0 references
    NP-completeness
    0 references
    graph algorithms
    0 references

    Identifiers