On computational complexity of length embeddability of graphs (Q2629266)

From MaRDI portal
Revision as of 11:13, 19 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
On computational complexity of length embeddability of graphs
scientific article

    Statements

    title
    On computational complexity of length embeddability of graphs (English)
    0 references
    author
    Mikhail Tikhomirov
    0 references
    publication date
    5 July 2016
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    graph embedding
    0 references
    distance graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C60
    0 references
    68Q17
    0 references
    05C12
    0 references
    zbMATH DE Number
    6601033
    0 references
    OpenAlex ID
    W1860256426
    0 references
    arXiv ID
    1410.5555
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2629266&oldid=39165506"
    Powered by MediaWiki