Maximal flow in branching trees and binary search trees

DOI10.1007/S11009-010-9164-0zbMath1231.90113OpenAlexW2073599685MaRDI QIDQ655924

Fabrizio Leisen, Federico Bassetti

Publication date: 26 January 2012

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-010-9164-0

zbMATH Keywords

binary search treesbranching treesmaximal flow in capacitated networkMcKean treesrandom capacities

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Stochastic network models in operations research (90B15)

Cites Work

• Speed of approach to equilibrium for Kac's caricature of a Maxwellian gas
• Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
• The profile of binary search trees
• Random Trees
• A note on the height of binary search trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal flow in branching trees and binary search trees