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, September 29, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Christoph Grunau

Improved Deterministic Network Decomposition

Network decomposition is a central tool in distributed graph algorithms. In a recent breakthrough, Rozhoň and Ghaffari presented the first deterministic LOCAL algorithm for network decomposition running in a polylogarithmic number of rounds [STOC'20]. This O(log^7 n)-round algorithm was the first improvement since the exponentially slower algorithm of Panconesi and Srinivasan [STOC'93]. Currently, the best-known deterministic and randomized algorithms for a variety of problems in the LOCAL model, including MIS and (Δ+1)-coloring, use network decomposition as a subroutine. Hence, an improved round complexity for network decomposition directly translates to improved round complexities for various deterministic and randomized algorithms in the LOCAL model. In this talk, we build and improve upon the network decomposition algorithm of Rozhoň and Ghaffari to obtain a deterministic network decomposition algorithm with a round complexity of O(log^5 n). This is joint work with Mohsen Ghaffari and Vasek Rozhoň.

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