Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 08, 2018, 12:15 pm
Duration: 45 minutes
Location: OAT S15/S16/S17
Speaker: Nemanja Draganic
Given a family F of subgraphs of a complete geometric graph G, a subgraph B of G is called a blocker of F if it shares an edge with every element of F, and if it has the minimal number of edges among subgraphs which satisfy this condition. In the talk we focus on describing blockers of non-crossing spanning trees of diameter at most 3, where we show the ideas which are also used to characterize the blockers of all non-crossing spanning trees.
Automatic MiSe System Software Version 1.4803M | admin login