Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054)

From MaRDI portal
Revision as of 20:58, 17 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129138991, #quickstatements; #temporary_batch_1723924200075)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
scientific article

    Statements

    title
    Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (English)
    0 references
    author
    Olivier Hudry
    0 references
    Antoine C. Lobstein
    0 references
    publication date
    26 March 2019
    0 references
    zbMATH Keywords
    complexity theory
    0 references
    graph theory
    0 references
    uniqueness of solution
    0 references
    polynomial reduction
    0 references
    locating-dominating codes
    0 references
    identifying codes
    0 references
    cites work
    Q3089301
    0 references
    Q4863436
    0 references
    Q5615282
    0 references
    Q5315023
    0 references
    Q3789614
    0 references
    Q2717197
    0 references
    Q2867320
    0 references
    Q4198056
    0 references
    Q4385525
    0 references
    Q4298260
    0 references
    Q4239067
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C12
    0 references
    05C69
    0 references
    94B60
    0 references
    zbMATH DE Number
    7041824
    0 references
    OpenAlex ID
    W2895699666
    0 references
    Wikidata QID
    Q129138991
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1733054&oldid=37600343"
    Powered by MediaWiki