Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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

Edge Operations and the Constrained Transition Problem for Spanning Trees

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login