Average reductions between random tree pairs

DOI10.2140/INVOLVE.2015.8.63zbMATH Open1309.05158OpenAlexW1994635752MaRDI QIDQ2340132FDOQ2340132

Authors: Sean Cleary, John Passaro, Yasser Toruno 

Publication date: 16 April 2015

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2015.8.63

Recommendations

• Numerical similarity and dissimilarity measures between two trees
• scientific article; zbMATH DE number 1974592
• Expected conflicts in pairs of rooted binary trees
• Optimal algorithms for comparing trees with labeled leaves
• Limit theorems for sequences of random trees

zbMATH Keywords

random binary tree pairs

Mathematics Subject Classification ID

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

Cited In (2)

• A note on distinguishing random trees populations
• Restricted rotation distance between k-ary trees

This page was built for publication: Average reductions between random tree pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340132)