Expected conflicts in pairs of rooted binary trees

DOI10.2140/INVOLVE.2013.6.323MaRDI QIDQ381179zbMATH OpenOpenAlexFDO

Authors Timothy Chu, Sean Cleary

Publication date 15 November 2013

Published in Involve (Search for Journal in Brave)

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

zbMATH Keywords

random binary tree pairs

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05)

Recommendations

• On coincidences of tuples in a binary tree with random labels of vertices
• Expected Costs in Some Classes of Binary Search Trees
• Paired-domination of trees
• scientific article; zbMATH DE number 434699
• Trees in graphs with conflict edges or forbidden transitions
• Publication:4206740
• An almost sure result for path lengths in binary search trees
• Trees and matchings
• Paired domination in trees

Cited in

(6)

• An efficient sampling algorithm for difficult tree pairs
• Average reductions between random tree pairs
• Edge Conflicts do not Determine Geodesics in the Associahedron
• Counting difficult tree pairs with respect to the rotation distance problem
• Common edges in rooted trees and polygonal triangulations
• Restricted rotation distance between k-ary trees

This page was built for publication: Expected conflicts in pairs of rooted binary trees

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