Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (Q3603534): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time |
scientific article |
Statements
Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (English)
0 references
17 February 2009
0 references
algorithm
0 references
graph embedding
0 references
minimum distance
0 references
