Deterministic Graph Coloring in the Streaming Model

09/30/2021
by   Sepehr Assadi, et al.
0

Recent breakthroughs in graph streaming have led to the design of single-pass semi-streaming algorithms for various graph coloring problems such as (Δ+1)-coloring, degeneracy-coloring, coloring triangle-free graphs, and others. These algorithms are all randomized in crucial ways and whether or not there is any deterministic analogue of them has remained an important open question in this line of work. We settle this fundamental question by proving that there is no deterministic single-pass semi-streaming algorithm that given a graph G with maximum degree Δ, can output a proper coloring of G using any number of colors which is sub-exponential in Δ. Our proof is based on analyzing the multi-party communication complexity of a related communication game, using random graph theory type arguments that may be of independent interest. We complement our lower bound by showing that just one extra pass over the input allows one to recover an O(Δ^2) coloring via a deterministic semi-streaming algorithm. This result is further extended to an O(Δ) coloring in O(logΔ) passes even in dynamic streams.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 8

07/19/2018

Coloring in Graph Streams

In this paper, we initiate the study of the vertex coloring problem of a...
12/01/2021

Near-Optimal Distributed Degree+1 Coloring

We present a new approach to randomized distributed graph coloring that ...
09/23/2021

Adversarially Robust Coloring for Graph Streams

A streaming algorithm is considered to be adversarially robust if it pro...
07/24/2018

Sublinear Algorithms for (Δ+ 1) Vertex Coloring

Any graph with maximum degree Δ admits a proper vertex coloring with Δ +...
07/28/2020

Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model

Graph sketching is a powerful technique introduced by the seminal work o...
01/11/2019

Depth First Search in the Semi-streaming Model

Depth first search (DFS) tree is a fundamental data structure for solvin...
11/20/2019

Streaming Frequent Items with Timestamps and Detecting Large Neighborhoods in Graph Streams

Detecting frequent items is a fundamental problem in data streaming rese...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.