Complexity of metric dimension on planar graphs (Q314819)

From MaRDI portal
Revision as of 16:18, 8 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of metric dimension on planar graphs
scientific article

    Statements

    title
    Complexity of metric dimension on planar graphs (English)
    0 references
    author
    Josep Diaz
    0 references
    Olli Pottonen
    0 references
    Erik Jan van Leeuwen
    0 references
    Maria J. Serna
    0 references
    publication date
    16 September 2016
    0 references
    zbMATH Keywords
    metric dimension
    0 references
    planar graph
    0 references
    outerplanar graph
    0 references
    NP-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C10
    0 references
    05C12
    0 references
    05C85
    0 references
    zbMATH DE Number
    6628246
    0 references
    OpenAlex ID
    W2460825048
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q314819&oldid=38059636"
    Powered by MediaWiki