Identifying and locating-dominating codes: NP-completeness results for directed graphs (Q4677540)

From MaRDI portal
Revision as of 10:06, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2167260
Language Label Description Also known as
English
Identifying and locating-dominating codes: NP-completeness results for directed graphs
scientific article; zbMATH DE number 2167260

    Statements

    Identifying and locating-dominating codes: NP-completeness results for directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references