A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A simple parallel tree contraction algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on optimal area algorithms for upward drawings of binary trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: TWO TREE DRAWING CONVENTIONS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4525739 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal orientations of cells in slicing floorplan designs / rank | |||
Normal rank | |||
Revision as of 12:07, 28 May 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
