Tight bounds on the path length of binary trees

DOI10.1007/BFB0020822MaRDI QIDQ4035694zbMATH OpenFDO

Authors Alfredo De Santis, Giuseppe Persiano

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0020822

zbMATH Keywords

binary treesmatchingpath lengthupper bounds

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Tight Upper and Lower Bounds on the Path Length of Binary Trees
• Extremal properties of ?-weighted binary trees
• On the path length of binary trees
• Maximal path length of binary trees
• Fringe thickness and maximum path length of binary trees

Cited in

(8)

• On the maximum edge length in VLSI layouts of complete binary trees
• Fringe thickness and maximum path length of binary trees
• 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
• scientific article; zbMATH DE number 1043915 (Why is no real title available?)
• Minimal path length of trees with known fringe

This page was built for publication: Tight bounds on the path length of binary trees

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