Drawing a tree on parallel lines (Q1963053)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1391583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Drawing a tree on parallel lines |
scientific article; zbMATH DE number 1391583 |
Statements
Drawing a tree on parallel lines (English)
0 references
20 January 2000
0 references
The authors consider the problem of drawing a tree on parallel lines. It is assumed that the tree vertices are placed on the lines, no edges intersect (except possibly at their endpoints), and the distance from the bottom line of any vertex is nondecreasing along any path starting at a vertex on the bottom line. An optimal linear-time algorithm is proposed.
0 references
tree
0 references
layout
0 references
linear-time algorithm
0 references
0.7956565618515015
0 references
0.7944874167442322
0 references
0.7872700095176697
0 references
