A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3885184 / rank | |||
Normal rank | |||
Revision as of 14:13, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph |
scientific article |
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
