Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (Q3603534): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_26 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W60726899 / rank | |||
Normal rank | |||
Latest revision as of 23:31, 19 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
