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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, August 10, 2017, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Christiana Lymouri

Simple and Near-Optimal Distributed Coloring for Sparse Graphs

Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with Delta+1 colors, where Delta denotes the maximum degree. Using Delta+1 colors may be unsatisfactory in sparse graphs, where not all nodes have such a high degree; it would be more desirable to use a number of colors that improves with sparsity. A standard measure that captures sparsity is arboricity, which is the smallest number of forests into which the edges of the graph can be partitioned.

We present simple randomized distributed algorithms that, with high probability, color any n-node alpha-arboricity graph:
- using ((2+eps) alpha) colors, for constant eps>0, in O(logn) rounds, if alpha=Omega(logn loglogn), or
- using O(alpha log(alpha) ) colors, in O(logn) rounds, or
- using O(alpha) colors, in O(logn min{loglogn, log(alpha)}) rounds.

These algorithms are nearly-optimal, as it is known by results of Linial [FOCS'87] and Barenboim and Elkin [PODC'08] that coloring with Theta(alpha) colors, or even poly(alpha) colors, requires Omega(log_{alpha} n) rounds. The previously best-known O(logn)-time result was a deterministic algorithm due to Barenboim and Elkin [PODC'08], which uses Theta(alpha ^2) colors. Barenboim and Elkin stated improving this number of colors as an open problem in their Distributed Graph Coloring Book.

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

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