A linear algorithm to find a rectangular dual of a planar triangulated graph (Q1097704): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rectangular duals of planar graphs / rank | |||
Normal rank | |||
Revision as of 14:41, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm to find a rectangular dual of a planar triangulated graph |
scientific article |
Statements
A linear algorithm to find a rectangular dual of a planar triangulated graph (English)
0 references
1988
0 references
linear algorithm
0 references
rectangular dual
0 references
planar triangulated graph
0 references
