A linear algorithm to find a rectangular dual of a planar triangulated graph (Q1097704): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56059583, #quickstatements; #temporary_batch_1706897434465 |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Sartaj K. Sahni / rank | |||
| Property / author | |||
| Property / author: Sartaj K. Sahni / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01762117 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2998789653 / rank | |||
Normal rank | |||
Latest revision as of 09:28, 30 July 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
