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

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Manuela Fischer

The Complexity of (Δ+1)-Vertex-Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation

We present a simple graph partitioning algorithm for the (Δ+1)-vertex-coloring problem in three well-studied models of distributed, parallel, and centralized computation. More concretely, our graph partitioning leads to an O(1)-round algorithm in the congested clique, improving over the O(log* Δ)-round algorithm by Parter and Su [DISC'18], as well as an O(log log log n)-round algorithm in the massively parallel computation model with strongly sublinear memory and a centralized local computation algorithm with poly(Δ)log n queries.

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