Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (Q3603534)
From MaRDI portal
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
