Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model (Q2921402)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
scientific article

    Statements

    Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2014
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references