The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200)

From MaRDI portal
Revision as of 01:26, 19 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7048097
Language Label Description Also known as
English
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments
scientific article; zbMATH DE number 7048097

    Statements

    The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    tournament
    0 references
    king
    0 references
    d-cover
    0 references
    dominating set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references