Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Files
Publication date
2014
Authors
Aichholzer, Oswin
Hackl, Thomas
Korman, Matias
van Kreveld, M.J.
Löffler, Maarten
Pilz, Alexander
Speckmann, Bettina
Welzl, Emo
Editors
Advisors
Supervisors
DOI
Document Type
Part of book
Metadata
Show full item recordCollections
License
Abstract
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane?
Keywords
CG, GRAPH
Citation
Aichholzer, O, Hackl, T, Korman, M, van Kreveld, M, Löffler, M, Pilz, A, Speckmann, B & Welzl, E 2014, Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. in 26th Canadian Conference on Computational Geometry (CCCG) 2014 Proceedings. pp. 233-238. < http://www.cccg.ca/proceedings/2014/ >