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

From MaRDI portal
Revision as of 18:13, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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

    Identifiers