Binary trees, fringe thickness and minimum path length

DOI10.1051/ITA/1995290301711MaRDI QIDQ4850323zbMATH OpenOpenAlexFDO

Authors Helen Cameron, D. Wood

Publication date 9 October 1995

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92503

zbMATH Keywords

binary treesminimum path lengthfringe thickness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fringe thickness and maximum path length of binary trees
• Maximal path length of binary trees
• Minimal path length of trees with known fringe
• A note on the expected path length of trees with known fringe
• On the path length of binary trees

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A note on the expected path length of trees with known fringe
• Maximal path length of binary trees
• On the path length of binary trees
• Tight Upper and Lower Bounds on the Path Length of Binary Trees
• Upper Bounds for the Total Path Length of Binary Trees

Cited in

(5)

• Structure of the path length set in asymmetric trees
• Fringe thickness and maximum path length of binary trees
• Path length and height in asymmetric binary branching trees
• Maximal path length of binary trees
• Minimal path length of trees with known fringe

This page was built for publication: Binary trees, fringe thickness and minimum path length

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