Maximal path length of binary trees
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- On the maximum edge length in VLSI layouts of complete binary trees
- The maximum binary tree problem
- Algorithms and Computation
- The Maximum Binary Tree Problem.
- Minimal path length of trees with known fringe
- scientific article; zbMATH DE number 3977047 (Why is no real title available?)
- Extremal values of the Sackin tree balance index
- A note on the expected path length of trees with known fringe
- Binary trees, fringe thickness and minimum path length
- Finding a length-constrained maximum-density path in a tree
- On the path length of binary trees
- Pm numbers, ambiguity, and regularity
- Maximal flow in branching trees and binary search trees
- Path length and height in asymmetric binary branching trees
- Binary trees with choosable edge lengths
- scientific article; zbMATH DE number 176528 (Why is no real title available?)
- Tight Upper and Lower Bounds on the Path Length of Binary Trees
- Fringe thickness and maximum path length of binary trees
This page was built for publication: Maximal path length of binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337670)
