Two algorithms for finding rectangular duals of planar graphs (Q6184635)
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: Two algorithms for finding rectangular duals of planar graphs |
scientific article; zbMATH DE number 7784178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for finding rectangular duals of planar graphs |
scientific article; zbMATH DE number 7784178 |
Statements
Two algorithms for finding rectangular duals of planar graphs (English)
0 references
5 January 2024
0 references
linear-time algorithms
0 references
regular edge labeling
0 references
4-connected planar triangular graphs
0 references
0 references
0.902047038078308
0 references
0.8930809497833252
0 references
0.852854311466217
0 references
0.8482397794723511
0 references
