A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326)
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 4099324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph |
scientific article; zbMATH DE number 4099324 |
Statements
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (English)
0 references
1987
0 references
planar graph
0 references
triangulated graphs
0 references
components
0 references
rectangular dual
0 references
algorithm
0 references
0.8921807408332825
0 references
0.8510145545005798
0 references
0.8438336849212646
0 references
0.7983829975128174
0 references
