Partitioning graph drawings and triangulated simple polygons into greedily routable regions (Q3459901)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning graph drawings and triangulated simple polygons into greedily routable regions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
11 January 2016
0 references
0.9977133274078368
0 references
0.7948611974716187
0 references
0.7626621127128601
0 references
0.7624964118003845
0 references
0.7613614201545715
0 references
