Pages that link to "Item:Q1823251"

The following pages link to On the upper bound on the rotation distance of binary trees (Q1823251):

Displaying 15 items.

• A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
• An improved kernel size for rotation distance in binary trees (Q763531) (← links)
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
• \(k\)-restricted rotation distance between binary trees (Q845999) (← links)
• On the rotation distance between binary trees (Q846983) (← links)
• Refined upper bounds for right-arm rotation distances (Q884484) (← links)
• A distance metric on binary trees using lattice-theoretic measures (Q910191) (← links)
• The Fermat star of binary trees (Q987825) (← links)
• An efficient upper bound of the rotation distance of binary trees (Q1607028) (← links)
• Lower bounds on the rotation distance of binary trees (Q1675757) (← links)
• Restricted rotation distance between binary trees. (Q1853166) (← links)
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
• A direct algorithm for restricted rotation distance (Q2390238) (← links)
• (Q2741329) (← links)
• An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)