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, May 08, 2018, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Nemanja Draganic

Blockers for non-crossing spanning trees in complete geometric graphs

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.

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