Drawing a tree on parallel lines

DOI10.1016/S0898-1221(99)00155-8MaRDI QIDQ1963053zbMATH OpenFDO

Authors Yanyan Li

Publication date 20 January 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(99)00155-8

zbMATH Keywords

layoutlinear-time algorithmtree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1555968
• scientific article; zbMATH DE number 2104082
• Minimum-layer drawings of trees (extended abstract)
• A note on parallel algorithms for optimal h-v drawings of binary trees
• A linear algorithm for compact box-drawings of trees

Cites work

• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)

Cited in

(6)

• How to draw a clustered tree
• A note on parallel algorithms for optimal h-v drawings of binary trees
• Minimum-layer drawings of trees (extended abstract)
• Schematisation of Tree Drawings
• scientific article; zbMATH DE number 1974105 (Why is no real title available?)
• How to draw free trees inside bounded rectilinear polygons

This page was built for publication: Drawing a tree on parallel lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963053)