A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0925-7721(96)00018-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073388777 / rank | |||
Normal rank | |||
Latest revision as of 09:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on parallel algorithms for optimal h-v drawings of binary trees |
scientific article |
Statements
A note on parallel algorithms for optimal h-v drawings of binary trees (English)
0 references
19 August 1998
0 references
parallel tree contraction
0 references
EREW processors
0 references
