The rotation distance of brooms
From MaRDI portal
Publication:6201876
DOI10.1016/j.ejc.2023.103877arXiv2211.07984OpenAlexW4388786082MaRDI QIDQ6201876
Jean Cardinal, Mario Valencia-Pabon, Lionel Pournin
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.07984
Trees (05C05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Quadratic programming (90C20) Distance in graphs (05C12) Polytopes and polyhedra (52B99)
Cites Work
- Unnamed Item
- The diameter of type \(D\) associahedra and the non-leaving-face property
- An improved kernel size for rotation distance in binary trees
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations
- Flip distance between triangulations of a simple polygon is NP-complete
- Graph properties of graph associahedra
- Flip distance between two triangulations of a point set is NP-complete
- Faces of generalized permutohedra
- Triangulations. Structures for algorithms and applications
- Rotation distance is fixed-parameter tractable
- A realization of graph associahedra
- A note on some tree similarity measures
- A type-B associahedron.
- The associahedron and triangulations of the \(n\)-gon
- On the diameter of tree associahedra
- Diameter estimates for graph associahedra
- Many non-equivalent realizations of the associahedron
- Computing the flip distance between triangulations
- Flip distance between triangulations of a planar point set is APX-hard
- The diameter of associahedra
- Coxeter complexes and graph-associahedra
- The asymptotic diameter of cyclohedra
- Happy endings for flip graphs
- A Linear-Time Approximation Algorithm for Rotation Distance
- Permutohedra, Associahedra, and Beyond
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Selected Applications of Minimum Cuts in Networks
- Minimum cuts and related problems
- On Rotations and the Generation of Binary Trees
- On the self-linking of knots
- Edge Conflicts do not Determine Geodesics in the Associahedron
- Complexity and Polynomially Solvable Special Cases of QUBO
- Competitive Online Search Trees on Trees
- The geometry of flip graphs and mapping class groups
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Permutation Polyhedra
- Homotopy Associativity of H-Spaces. I
- Monoïdes préordonnés et chaînes de Malcev
- An exact characterization of saturation for permutation matrices
- A polynomial case of unconstrained zero-one quadratic optimization
- Hopf Monoids and Generalized Permutahedra
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances
This page was built for publication: The rotation distance of brooms
