Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300)

From MaRDI portal
Revision as of 20:51, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7617246
Language Label Description Also known as
English
Revisiting and Improving Upper Bounds for Identifying Codes
scientific article; zbMATH DE number 7617246

    Statements

    title
    Revisiting and Improving Upper Bounds for Identifying Codes (English)
    0 references
    DOI
    10.1137/22M148999X
    0 references
    author
    Florent Foucaud
    0 references
    Tuomo Lehtilä
    0 references
    publication date
    15 November 2022
    0 references
    zbMATH DE Number
    7617246
    0 references
    zbMATH Keywords
    identifying codes
    0 references
    trees
    0 references
    bipartite graphs
    0 references
    upper bound
    0 references
    arXiv ID
    2204.05250
    0 references
    OpenAlex ID
    W4308731351
    0 references
    cites work
    Q4659582
    0 references
    Q5442540
    0 references
    On separating systems
    0 references
    Induced subsets
    0 references
    Q5224479
    0 references
    Q4329059
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5048300&oldid=37458291"
    Powered by MediaWiki