Packing plane spanning trees and paths in complete geometric graphs

Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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? We show that this number is in Ω(n). Further, we consider variants of this problem by bounding the diameter and the degree of the trees (in particular considering spanning paths).

Original languageEnglish
Pages (from-to)35-41
Number of pages7
JournalInformation Processing Letters
Volume124
DOIs
Publication statusPublished - 1 Aug 2017

    Fingerprint

Keywords

  • Combinatorial problems
  • Edge disjoint graphs
  • Geometric graph
  • Spanning tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

Aichholzer, O., Hackl, T., Korman, M., van Kreveld, M., Löffler, M., Pilz, A., ... Welzl, E. (2017). Packing plane spanning trees and paths in complete geometric graphs. Information Processing Letters, 124, 35-41. https://doi.org/10.1016/j.ipl.2017.04.006