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

From MaRDI portal
Revision as of 14:01, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1199621)
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
    11 May 2005
    0 references
    0 references
    0 references
    0 references
    0 references