Untangling planar graphs from a specified vertex position-Hard cases (Q534342)

From MaRDI portal
Revision as of 13:46, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Untangling planar graphs from a specified vertex position-Hard cases
scientific article

    Statements

    Untangling planar graphs from a specified vertex position-Hard cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    0 references
    combinatorial geometry
    0 references
    graph drawing
    0 references
    planar graphs
    0 references
    untangling problem
    0 references