Parameterized and approximation complexity of the detection pair problem in graphs (Q5371038)

From MaRDI portal
Revision as of 02:35, 20 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6797257
Language Label Description Also known as
English
Parameterized and approximation complexity of the detection pair problem in graphs
scientific article; zbMATH DE number 6797257

    Statements

    Parameterized and approximation complexity of the detection pair problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    detection pair
    0 references
    metric dimension
    0 references
    dominating set
    0 references
    approximation algorithm
    0 references
    parameterized complexity
    0 references
    0 references
    0 references