Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, April 02, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Sabrina Wiedersheim

Spanning Trees, Spiders and Snowflakes

The problem of finding a spanning tree with few branch vertices (vertices of degree greater than two) is motivated by the design of communication networks: We are interested in sending signals from a single source to many destinations with a minimum number of connections over fiber links (spanning tree) and subject to this with as few sophisticated light splitting switchers (branch vertices) as possible. In graph theoretical terms a best solution of this problem is a spanning tree with at most one branch vertex. These spanning trees are called spanning spiders.

The decision problem whether there is a spanning spider in a given connected graph G= (E,V) is NP-complete. We describe an O(|E| |V| log |V| 2^k) time algorithm testing the existence of a spider through k vertices (1 <= k <= |V|) in G and reconstructing such a spider, provided there exists one. I will also give a brief impression of further results about the minimum number of branch vertices we need to construct a spanning tree in general, spanning snowflakes, Euclidean graphs and conclude with some open questions.

Joint work with Michael Hoffmann.

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

Previous talks by year:   2025  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