Packing plane spanning trees and paths in complete geometric graphs

O. Aichholzer, T. Hackl, M. Korman, M.J. van Kreveld, M. Löffler, A. Pilz, B. Speckmann, E. Welzl

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
71 Downloads (Pure)

Abstract

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

Original languageEnglish
Title of host publication26th Canadian Conference on Computational Geometry (CCCG 2014), 11-13 August 2014, Halifax, Canada
Pages233-238
Number of pages6
Publication statusPublished - 2014
Event26th Canadian Conference on Computational Geometry (CCCG 2014) - Halifax, Canada
Duration: 11 Aug 201413 Aug 2014
Conference number: 26
https://projects.cs.dal.ca/cccg2014/

Conference

Conference26th Canadian Conference on Computational Geometry (CCCG 2014)
Abbreviated titleCCCG 2014
CountryCanada
CityHalifax
Period11/08/1413/08/14
Internet address

Fingerprint Dive into the research topics of 'Packing plane spanning trees and paths in complete geometric graphs'. Together they form a unique fingerprint.

Cite this