Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6794045
| 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; zbMATH DE number 6794045 |
Statements
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (English)
0 references
20 October 2017
0 references
greedy region decomposition
0 references
increasing-chord drawings
0 references
decomposing graph drawings
0 references
greedy routing in wireless sensor networks
0 references
0 references
0 references
0 references
0 references
0.8751637
0 references
0.8739407
0 references
0.8738729
0 references
0.87315714
0 references
0.8715198
0 references
