On computational complexity of length embeddability of graphs (Q2629266)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On computational complexity of length embeddability of graphs
scientific article

    Statements

    On computational complexity of length embeddability of graphs (English)
    0 references
    0 references
    5 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    graph embedding
    0 references
    distance graph
    0 references
    0 references
    0 references