Depth of nodes in random recursive \(k\)-ary trees

DOI10.1016/J.IPL.2005.11.020zbMath1187.68347OpenAlexW2047055724MaRDI QIDQ844171

Mehri Javanian, Mohammed Q. Vahidi-Asl

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.020

zbMATH Keywords

combinatorial problemsanalysis of algorithmslimiting distributionsrecursive trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Profile of random exponential recursive trees ⋮ Note on the exponential recursive k-ary trees ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees

Cites Work

• Asymptotic degree distribution in random recursive trees
• DEPTH AND PATH LENGTH OF HEAP ORDERED TREES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Depth of nodes in random recursive \(k\)-ary trees