Open Access
Translator Disclaimer
2013 Expected conflicts in pairs of rooted binary trees
Timothy Chu, Sean Cleary
Involve 6(3): 323-332 (2013). DOI: 10.2140/involve.2013.6.323

Abstract

Rotation distance between rooted binary trees measures the extent of similarity of two trees with ordered leaves. There are no known polynomial-time algorithms for computing rotation distance. If there are common edges or immediately changeable edges between a pair of trees, the rotation distance problem breaks into smaller subproblems. The number of crossings or conflicts of a tree pair also gives some measure of the extent of similarity of two trees. Here we describe the distribution of common edges and immediately changeable edges between randomly selected pairs of trees via computer experiments, and examine the distribution of the amount of conflicts between such pairs.

Citation

Download Citation

Timothy Chu. Sean Cleary. "Expected conflicts in pairs of rooted binary trees." Involve 6 (3) 323 - 332, 2013. https://doi.org/10.2140/involve.2013.6.323

Information

Received: 26 June 2012; Revised: 22 October 2012; Accepted: 23 October 2012; Published: 2013
First available in Project Euclid: 20 December 2017

zbMATH: 1274.05066
MathSciNet: MR3101764
Digital Object Identifier: 10.2140/involve.2013.6.323

Subjects:
Primary: 05C05 , 68P05

Keywords: random binary tree pairs

Rights: Copyright © 2013 Mathematical Sciences Publishers

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.6 • No. 3 • 2013
MSP
Back to Top