Destruction of very simple trees

DOI10.1007/S00453-006-0100-1zbMath1106.68081arXivmath/0412155OpenAlexW3103793925MaRDI QIDQ866949

Alois Panholzer, James Allen Fill, Nevin Kapur

Publication date: 14 February 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0412155

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent ⋮ The uncover process for random labeled trees ⋮ Cutting down trees with a Markov chainsaw ⋮ A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree ⋮ Inverting the cut-tree transform

This page was built for publication: Destruction of very simple trees