An efficient algorithm for estimating rotation distance between two binary trees (Q5312707): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160500069870
+Normal rank
@@ Property / OpenAlex ID @@
+W2025994050
@@ Property / OpenAlex ID: W2025994050 / rank @@
+Normal rank
@@ Property / cites work @@
+General Balanced Trees
@@ Property / cites work: General Balanced Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric binary B-trees: Data structure and maintenance algorithms
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+A note on some tree similarity measures
@@ Property / cites work: A note on some tree similarity measures / rank @@
+Normal rank
@@ Property / cites work @@
+The number of coverings in four catalan lattices
@@ Property / cites work: The number of coverings in four catalan lattices / rank @@
+Normal rank
@@ Property / cites work @@
+The rotation graph of binary trees is Hamiltonian
@@ Property / cites work: The rotation graph of binary trees is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+On Rotations and the Generation of Binary Trees
@@ Property / cites work: On Rotations and the Generation of Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the loopless generation of binary tree sequences
+Normal rank
@@ Property / cites work @@
+Graph of triangulations of a convex polygon and tree of triangulations
+Normal rank
@@ Property / cites work @@
+Enumerating, Ranking and Unranking Binary Trees
@@ Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Short notes: Some Properties of the Rotation Lattice of Binary Trees
+Normal rank
@@ Property / cites work @@
+Generating binary trees by Glivenko classes on Tamari lattices
+Normal rank
@@ Property / cites work @@
+An efficient upper bound of the rotation distance of binary trees
+Normal rank
@@ Property / cites work @@
+On the upper bound on the rotation distance of binary trees
+Normal rank
@@ Property / cites work @@
+Flipping edges in triangulations
@@ Property / cites work: Flipping edges in triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+On the deque conjecture for the splay algorithm
@@ Property / cites work: On the deque conjecture for the splay algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted rotation distance between binary trees.
+Normal rank
@@ Property / cites work @@
+Bounding restricted rotation distance
@@ Property / cites work: Bounding restricted rotation distance / rank @@
+Normal rank
@@ Property / cites work @@
+A direct algorithm for restricted rotation distance
+Normal rank
@@ Property / cites work @@
+Right-arm rotation distance between binary trees
@@ Property / cites work: Right-arm rotation distance between binary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank