Hardness of metric dimension in graphs of constant treewidth (Q2093561)

From MaRDI portal
Revision as of 00:55, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hardness of metric dimension in graphs of constant treewidth
scientific article

    Statements

    title
    Hardness of metric dimension in graphs of constant treewidth (English)
    0 references
    author
    Shao-hua Li
    0 references
    Marcin Pilipczuk
    0 references
    published in
    Algorithmica
    0 references
    publication date
    27 October 2022
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    constant treewidth
    0 references
    NP-hard
    0 references

    Identifiers

    zbMATH DE Number
    7608286
    0 references
    OpenAlex ID
    W3131586115
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2093561&oldid=38874989"
    Powered by MediaWiki