Pages that link to "Item:Q1337670"
From MaRDI portal
The following pages link to Maximal path length of binary trees (Q1337670):
Displaying 17 items.
- Maximal flow in branching trees and binary search trees (Q655924) (← links)
- Minimal path length of trees with known fringe (Q673649) (← links)
- Path length and height in asymmetric binary branching trees (Q933215) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- On the maximum edge length in VLSI layouts of complete binary trees (Q1081305) (← links)
- Fringe thickness and maximum path length of binary trees (Q1281386) (← links)
- A note on the expected path length of trees with known fringe (Q1350914) (← links)
- Finding a length-constrained maximum-density path in a tree (Q1781798) (← links)
- Extremal values of the Sackin tree balance index (Q2033483) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Pm numbers, ambiguity, and regularity (Q3142275) (← links)
- (Q3743340) (← links)
- On the path length of binary trees (Q3829055) (← links)
- Tight Upper and Lower Bounds on the Path Length of Binary Trees (Q4286225) (← links)
- Binary trees, fringe thickness and minimum path length (Q4850323) (← links)
- Algorithms and Computation (Q5191636) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)