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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1199621
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Antoine C. Lobstein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1109/tit.2002.800490 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140429404 / rank
 
Normal rank

Latest revision as of 09:06, 30 July 2024

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

    0 references
    0 references
    0 references
    0 references
    0 references