An improved kernel size for rotation distance in binary trees (Q763531): 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.1016/j.ipl.2010.04.022
+Normal rank
@@ Property / OpenAlex ID @@
+W2026496675
@@ Property / OpenAlex ID: W2026496675 / rank @@
+Normal rank
@@ Property / cites work @@
+General Balanced Trees
@@ Property / cites work: General Balanced Trees / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for estimating rotation distance between two binary trees
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Rotation distance is fixed-parameter tractable
@@ Property / cites work: Rotation distance is fixed-parameter tractable / 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 @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lost Continent of Polynomial Time: Preprocessing and Kernelization
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Graph of triangulations of a convex polygon and tree of triangulations
+Normal rank
@@ Property / cites work @@
+Relaxed balance using standard rotations
@@ Property / cites work: Relaxed balance using standard rotations / 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 upper bound on the rotation distance of binary trees
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Short notes: Some Properties of the Rotation Lattice of Binary Trees
+Normal rank
@@ Property / cites work @@
+Q3838181
@@ Property / cites work: Q3838181 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393275
@@ Property / cites work: Q4393275 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating binary trees by transpositions
@@ Property / cites work: Generating binary trees by transpositions / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Rotation Distance, Triangulations, and Hyperbolic Geometry
+Normal rank
@@ Property / cites work @@
+Generating binary trees using rotations
@@ Property / cites work: Generating binary trees using rotations / rank @@
+Normal rank