Repeated fringe subtrees in random rooted trees

DOI10.1137/1.9781611973761.7zbMath1430.05114OpenAlexW2293244104MaRDI QIDQ5194795

Dimbinaina Ralaivaosaona, Stephan G. Wagner

Publication date: 17 September 2019

Published in: 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973761.7

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (4)

Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Simplifications of Uniform Expressions Specified by Systems ⋮ Asymptotic enumeration of compacted binary trees of bounded right height ⋮ Distinct fringe subtrees in random trees

This page was built for publication: Repeated fringe subtrees in random rooted trees