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

From MaRDI portal
Revision as of 02:12, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Untangling planar graphs from a specified vertex position-Hard cases
scientific article

    Statements

    title
    Untangling planar graphs from a specified vertex position-Hard cases (English)
    0 references
    author
    Mihyun Kang
    0 references
    Oleg Pikhurko
    0 references
    Mathias Schacht
    0 references
    Oleg Verbitsky
    0 references
    O. V. Ravskyj
    0 references
    publication date
    17 May 2011
    0 references
    zbMATH DE Number
    5895540
    0 references
    zbMATH Keywords
    combinatorial geometry
    0 references
    graph drawing
    0 references
    planar graphs
    0 references
    untangling problem
    0 references
    OpenAlex ID
    W2012957023
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q534342&oldid=35227394"
    Powered by MediaWiki