• Corpus ID: 219792874

Palette Sparsification Beyond $(\Delta+1)$ Vertex Coloring

  title={Palette Sparsification Beyond \$(\Delta+1)\$ Vertex Coloring},
  author={Noga Alon and Sepehr Assadi},
  journal={arXiv: Data Structures and Algorithms},
  • N. AlonSepehr Assadi
  • Published 18 June 2020
  • Mathematics, Computer Science
  • arXiv: Data Structures and Algorithms
A recent palette sparsification theorem of Assadi, Chen, and Khanna [SODA'19] states that in every $n$-vertex graph $G$ with maximum degree $\Delta$, sampling $O(\log{n})$ colors per each vertex independently from $\Delta+1$ colors almost certainly allows for proper coloring of $G$ from the sampled colors. Besides being a combinatorial statement of its own independent interest, this theorem was shown to have various applications to design of algorithms for $(\Delta+1)$ coloring in different… 
2 Citations

Tables from this paper

Independent transversals in bipartite correspondence-covers

Suppose $G$ and $H$ are bipartite graphs and $L: V(G)\to 2^{V(H)}$ induces a partition of $V(H)$ such that the subgraph of $H$ induced between $L(v)$ and $L(v')$ is a matching whenever $vv'\in E(G)$.

Efficient randomized distributed coloring in CONGEST

This work presents a new randomized distributed vertex coloring algorithm for the standard CONGEST model, where the network is modeled as an n-node graph G, and where the nodes of G operate in synchronous communication rounds in which they can exchange O(logn)-bit messages over all the edges of G.



Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models

It is proved that any randomized coloring algorithm that uses $\kappa(G)+1$ many colors, would require $\Omega(n^2)$ storage in the one pass streaming model, and many queries in the general graph query model, where $n$ is the number of vertices in the graph.

Bounding $\chi$ by a fraction of $\Delta$ for graphs without large cliques

The greedy coloring algorithm shows that a graph of maximum degree at most $\Delta$ has chromatic number at most $\Delta + 1$, and this is tight for cliques. Much attention has been devoted to

Sublinear Algorithms for (Δ+ 1) Vertex Coloring

A remarkably simple meta-algorithm for the (∆ + 1) coloring problem: Sample O(log n) colors for each vertex independently and uniformly at random from the ∆+ 1 colors; find a proper coloring of the graph using only the sampled colors of each vertex.

Randomized ( ∆ + 1 )-Coloring in O ( log ∗ ∆ ) Congested Clique Rounds

This work significantly improves upon a recent breakthrough and presents a randomized (∆ + 1)-coloring algorithm with O(log∗∆) rounds, with high probability.

Set Partitioning via Inclusion-Exclusion

The algorithms are based on the principle of inclusion-exclusion and the zeta transform and get exact algorithms in time for several well-studied partition problems including domatic number, chromaticNumber, maximum $k$-cut, bin packing, list coloring, and the chromatic polynomial.

Distributed coloring algorithms for triangle-free graphs

Distributed (∆+1)-coloring in sublogarithmic rounds

A new randomized coloring algorithm for (∆+1)-coloring running in O(√log ∆)+ 2^O( ∼log log n) rounds with probability 1-1/n^Ω(1) in a graph with n nodes and maximum degree ∆.

(Δ+1) Coloring in the Congested Clique Model

Improved algorithms for the (∆ + 1) (vertex) coloring problem in the Congested Clique model of distributed computing and a deterministic algorithm that works in O(log ∆) rounds is presented.

(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting

It is shown that a (2Δ − 1)-edge-coloring can be computed in time smaller than loge n for any e > 0, specifically, in eO([EQUATION]log log n) rounds.

An optimal distributed (Δ+1)-coloring algorithm?

This paper presents a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log∗n + Detd(poly logn)) time, where Det d(n′) is the deterministic complexity of (deg+1-list coloring) on n′-vertex graphs.