Edge Conflicts do not Determine Geodesics in the Associahedron

DOI10.1137/17M1114582zbMath1385.05067arXiv1510.07584OpenAlexW3105801397MaRDI QIDQ4638997

Sean Cleary, Roland Maio

Publication date: 2 May 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07584

zbMATH Keywords

random binary trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The rotation distance of brooms ⋮ Rainbow Cycles in Flip Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expected conflicts in pairs of rooted binary trees
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• Rotation distance is fixed-parameter tractable
• A note on some tree similarity measures
• Common edges in rooted trees and polygonal triangulations
• The diameter of associahedra
• A Linear-Time Approximation Algorithm for Rotation Distance
• Rotation Distance, Triangulations, and Hyperbolic Geometry