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, April 30, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Julian Portmann

Improved Network Decompositions and Applications

Network decompositions, or low-diameter graph decompositions, are a fundamental tool in the study of locality in graphs. We present an improved deterministic distributed algorithm for constructing network decompositions of power graphs using small messages. This leads to improvements for a number of other problems: a faster randomized algorithm for computing a Maximal Independent Set, improving on a result of Ghaffari [SODA'19]; faster deterministic distributed algorithms for constructing spanners and approximations of distributed set cover, improving results of Ghaffari and Kuhn [DISC'18]; and faster deterministic distributed algorithms for constructing neighborhood covers, resolving an open question of Elkin [SODA'04]. (joint work with Mohsen Ghaffari)

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