Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (Q3603534)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time |
scientific article; zbMATH DE number 5508808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time |
scientific article; zbMATH DE number 5508808 |
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
0.9681807160377502
0 references
0.8146825432777405
0 references
0.7967180013656616
0 references
