Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?

keywords: Computational Geometry, Graphs Theory

Journal Article (peer-reviewed)

Alexander Pilz, Bettina Speckmann, Emo Welzl, Maarten Löffler, Marc van Kreveld, Matias Korman, Oswin Aichholzer, Thomas Hackl
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Information Processing Letters
124, 35–41, 2017
http://dx.doi.org/10.1016/j.ipl.2017.04.006

Conference Proceedings (peer-reviewed)

Alexander Pilz, Bettina Speckmann, Emo Welzl, Maarten Löffler, Marc van Kreveld, Matias Korman, Oswin Aichholzer, Thomas Hackl
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Proc. 26th Canadian Conference on Computational Geometry
233–238, 2014

back to list