Complexity of Finding Non-Planar Rectilinear Drawings of Graphs (Q3073681)

From MaRDI portal
Revision as of 21:47, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
scientific article

    Statements

    title
    Complexity of Finding Non-Planar Rectilinear Drawings of Graphs (English)
    0 references
    author
    Ján Maňuch
    0 references
    Murray Patterson
    0 references
    Sheung-Hung Poon
    0 references
    Chris Thachuk
    0 references
    publication date
    11 February 2011
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5850634
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3073681&oldid=16128675"
    Powered by MediaWiki