Pretty-printing of trees

DOI10.1002/SPE.4380100706MaRDI QIDQ3868755zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(10)

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

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

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