Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q3459901)

From MaRDI portal
Revision as of 16:52, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
scientific article

    Statements

    Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2016
    0 references
    0 references
    0 references
    0 references