Binary trees, fringe thickness and minimum path length

DOI10.1051/ita/1995290301711zbMath0833.68092OpenAlexW195039283MaRDI QIDQ4850323

Helen Cameron, Derick 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)

Related Items (1)

Fringe thickness and maximum path length of binary trees

Cites Work

• Unnamed Item
• Maximal path length of binary trees
• A note on the expected path length of trees with known fringe
• 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

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