Pretty-printing of trees

DOI10.1002/spe.4380100706zbMath0431.68040OpenAlexW2066364954MaRDI QIDQ3868755

Jean Vaucher

Publication date: 1980

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380100706

zbMATH Keywords

layouttree data structurestree printing

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of software (68N99)

Related Items (10)

Constructing format-preserving printing from syntax-directed definitions ⋮ A data-parallel algorithm for minimum-width tree layout ⋮ Functional Pearls ⋮ Functional Pearls ⋮ The realization problem for Euclidean minimum spanning trees is NP-hard ⋮ The complexity of drawing trees nicely ⋮ Three-dimensional graph drawing ⋮ A note on optimal area algorithms for upward drawings of binary trees ⋮ Optimal binary search trees ⋮ Drawing plane graphs nicely

This page was built for publication: Pretty-printing of trees