Rotation Distance, Triangulations, and Hyperbolic Geometry

DOI10.2307/1990951zbMATH Open0653.51017OpenAlexW4231033470WikidataQ56067257 ScholiaQ56067257MaRDI QIDQ3799259FDOQ3799259

Authors:

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/1990951

Recommendations

• scientific article; zbMATH DE number 1161281
• \(k\)-restricted rotation distance between binary trees
• On the rotation distance between binary trees
• On the rotation distance of graphs
• On the upper bound on the rotation distance of binary trees

zbMATH Keywords

hyperbolic geometrytriangulationspolyhedrarotation distance

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Hyperbolic and elliptic geometries (general) and generalizations (51M10) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-adjusting binary search trees
• Hyperbolic geometry: The first 150 years
• A theorem on graphs
• A Theorem on Planar Graphs
• Title not available (Why is that?)
• A note on some tree similarity measures
• Wagner's theorem for torus graphs

Cited In (only showing first 100 items - show all)

• Geometry of the space of phylogenetic trees
• An efficient upper bound of the rotation distance of binary trees
• Flip distance between two triangulations of a point set is NP-complete
• A metric for rooted trees with unlabeled vertices based on nested parentheses
• On a subposet of the Tamari lattice
• Noncrossing sets and a Grassmann associahedron
• Topological recursion for symplectic volumes of moduli spaces of curves
• Spin network quantum simulator
• The Markovian hyperbolic triangulation
• The rotation graph of \(k\)-ary trees is Hamiltonian
• Rotation sequences and edge-colouring of binary tree pairs
• \(k\)-restricted rotation distance between binary trees
• Flipping edge-labelled triangulations
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• On the rotation distance between binary trees
• Triangle-free triangulations
• Refined upper bounds for right-arm rotation distances
• A type-B associahedron.
• The Fermat star of binary trees
• Multitriangulations, pseudotriangulations and primitive sorting networks
• Rotation distance is fixed-parameter tractable
• Bounding restricted rotation distance
• The diameter of associahedra
• Two shortest path metrics on well-formed parentheses strings
• The phagocyte lattice of Dyck words
• A point set whose space of triangulations is disconnected
• Associahedra via spines
• Catalan triangulations of the Möbius band
• Lower bounds on the rotation distance of binary trees
• 2-toroids and their 3-triangulation
• A linear-time approximation algorithm for rotation distance
• Dissecting the circle, at random
• Rotational tree structures on binary trees and triangulations
• Topological recursion for the Poincaré polynomial of the combinatorial moduli space of curves
• A generalization of diagonal flips in a convex polygon
• Flip graphs of bounded degree triangulations
• The geometry of graphs and some of its algorithmic applications
• On the upper bound on the rotation distance of binary trees
• A survey of parameterized algorithms and the complexity of edge modification
• Iterated fiber polytopes
• Graphs of triangulations and perfect matchings
• On the deque conjecture for the splay algorithm
• On minimal triangulations of products of convex polygons
• How I `met' Dov Tamari
• Computing spin networks
• A direct algorithm for restricted rotation distance
• The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
• Restricted rotation distance between binary trees.
• Constructions and complexity of secondary polytopes
• Enumeration of rooted planar triangulations with respect to diagonal flips
• An improved kernel for the flip distance problem on simple convex polygons
• Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra
• Transforming plane triangulations by simultaneous diagonal flips
• A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
• Discriminative measures for comparison of phylogenetic trees
• Random recursive triangulations of the disk via fragmentation theory
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Multitriangulations as complexes of star polygons
• Symmetries of unlabelled planar triangulations
• The diameter of type \(D\) associahedra and the non-leaving-face property
• Minimum ideal triangulations of hyperbolic 3-manifolds
• An algorithm to compute the möbius function of the rotation lattice of binary trees
• The asymptotic diameter of cyclohedra
• Signed diagonal flips and the four color theorem
• The higher Stasheff‐Tamari posets
• An improved kernel size for rotation distance in binary trees
• Flip distance between triangulations of a planar point set is APX-hard
• \(W\)-associahedra have the non-leaving-face property
• Cut loci in lens manifolds
• Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
• Flips in planar graphs
• Computing the flip distance between triangulations
• Flipping in spirals
• Title not available (Why is that?)
• Finding Eulerian cycle decompositions and the rotation distance between binary trees
• Title not available (Why is that?)
• A sequent calculus for a semi-associative law
• Title not available (Why is that?)
• Normalish Amenable Subgroups of the R. Thompson Groups
• A proof of the orbit conjecture for flipping edge-labelled triangulations
• Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
• Simultaneous flips on triangulated surfaces
• Poincaré rotation numbers and Riesz and Voronoi means.
• Distances in domino flip graphs
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
• A Motzkin filter in the Tamari lattice
• Title not available (Why is that?)
• Compatibility fans for graphical nested complexes
• Edge Conflicts do not Determine Geodesics in the Associahedron
• On flips in planar matchings
• A journey from the Hitchin section to the oper moduli
• A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
• Neighborhoods of trees in circular orderings
• The pruning-grafting lattice of binary trees
• Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex
• Flip-graph moduli spaces of filling surfaces
• Modular flip-graphs of one-holed surfaces
• Title not available (Why is that?)
• Lagrangian fillings in \(A\)-type and their Kálmán loop orbits
• Posets and spaces of \(k\)-noncrossing RNA structures

This page was built for publication: Rotation Distance, Triangulations, and Hyperbolic Geometry

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