Reconfiguration of non-crossing spanning trees

MaRDI QIDQ6654540zbMATH OpenFDO

Authors Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Adam Hesterberg, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno

Publication date 19 December 2024

Published in Journal of Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

exact minimum flip distances for small point sets

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• A note on the flip distance between non-crossing spanning trees
• Sequences of spanning trees and a fixed tree theorem
• A quadratic distance bound on sliding between crossing-free spanning trees
• Planar tree transformation: results and counterexample
• Flip distance to some plane configurations

Cited in

(5)

• A note on the flip distance between non-crossing spanning trees
• A linear time algorithm for the flip distance between plane spanning paths in convex point sets
• Reconfiguration of plane trees in convex geometric graphs
• Constrained flips in plane spanning trees
• Reconfigurations of plane caterpillars and paths (poster abstract)

This page was built for publication: Reconfiguration of non-crossing spanning trees

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