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

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: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

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?

Original language	English
Title of host publication	26th Canadian Conference on Computational Geometry (CCCG) 2014 Proceedings
Pages	233-238
Publication status	Published - 2014

Keywords

CG, GRAPH

Access to Document

34Final published version, 336 KB

http://www.cccg.ca/proceedings/2014/

Cite this

@inproceedings{c7d3b770d648475d87e6002ecc647981,

title = "Packing Plane Spanning Trees and Paths in Complete Geometric Graphs",

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",

author = "Oswin Aichholzer and Thomas Hackl and Matias Korman and {van Kreveld}, Marc and Maarten L{\"o}ffler and Alexander Pilz and Bettina Speckmann and Emo Welzl",

year = "2014",

language = "English",

pages = "233--238",

booktitle = "26th Canadian Conference on Computational Geometry (CCCG) 2014 Proceedings",

}

TY - GEN

T1 - Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

AU - Aichholzer, Oswin

AU - Hackl, Thomas

AU - Korman, Matias

AU - van Kreveld, Marc

AU - Löffler, Maarten

AU - Pilz, Alexander

AU - Speckmann, Bettina

AU - Welzl, Emo

PY - 2014

Y1 - 2014

N2 - 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?

AB - 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?

KW - CG, GRAPH

M3 - Conference contribution

SP - 233

EP - 238

BT - 26th Canadian Conference on Computational Geometry (CCCG) 2014 Proceedings

ER -

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this