Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, October 03, 2023, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Benjamin O’Sullivan
An edge operation is any operation removing an edge from the edge set of a graph and replacing it with another. A well known example is the edge exchange, or edge flip, operation. The transition problem for plane geometric spanning trees asks the question of how many instances of an edge operation are required to transition from one spanning tree to another such that all intermediate graphs are also plane geometric spanning trees. In the constrained transition problem certain edges are not allowed to be removed by an edge operation, I show that this problem is feasible for point sets in general position and for edge exchanges, compatible edge exchanges, rotations, and empty triangle rotations. This work was a part of my master thesis.
Automatic MiSe System Software Version 1.4803M | admin login