On the diameter of geometric path graphs of points in convex position

DOI10.1016/j.ipl.2008.12.017zbMath1191.68760OpenAlexW2053412037MaRDI QIDQ976134

Ro-Yu Wu, Jou-Ming Chang

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.017

zbMATH Keywords

flipdiametercombinatorial problemsgeometric path graphplane spanning path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Reconstruction of the path graph ⋮ Flipping plane spanning paths ⋮ Amortized efficiency of generating planar paths in convex position ⋮ Transition operations over plane trees

Cites Work

• A quadratic distance bound on sliding between crossing-free spanning trees
• Flips in planar graphs
• Planar tree transformation: results and counterexample
• Geometric tree graphs of points in convex position
• Distances between graphs under edge operations
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Reverse search for enumeration
• On planar path transformation
• Hamilton cycles in the path graph of a set of points in convex position
• Sequences of spanning trees and a fixed tree theorem

This page was built for publication: On the diameter of geometric path graphs of points in convex position