License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2022.1
URN: urn:nbn:de:0030-drops-171920
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/17192/
Go to the corresponding LIPIcs Volume Portal

Assadi, Sepehr

Graph Coloring, Palette Sparsification, and Beyond (Invited Talk)

pdf-format:
LIPIcs-DISC-2022-1.pdf (0.3 MB)

Abstract

Graph coloring is a central problem in graph theory and has numerous applications in diverse areas of computer science. An important and well-studied case of graph coloring problems is the (Δ+1) (vertex) coloring problem where Δ is the maximum degree of the graph. Not only does every graph admit a (Δ + 1) coloring, but in fact we can find one quite easily in linear time and space via a greedy algorithm. But are there more efficient algorithms for (Δ+1) coloring that can process massive graphs that even this algorithm cannot handle?
This talk overviews recent results that answer this question in affirmative across a variety of models dedicated to processing massive graphs - streaming, sublinear-time, massively parallel computation, distributed communication, etc. - via a single unified approach: Palette Sparsification. We survey the ideas behind these results and techniques, their generalizations to various other coloring problems and even beyond (e.g., to clustering problems), as well as their natural limitations.
The talk is based on a series of joint works with Noga Alon, Andrew Chen, Yu Chen, Sanjeev Khanna, Pankaj Kumar, Parth Mittal, Glenn Sun, and Chen Wang.

BibTeX - Entry

@InProceedings{assadi:LIPIcs.DISC.2022.1,
  author =	{Assadi, Sepehr},
  title =	{{Graph Coloring, Palette Sparsification, and Beyond}},
  booktitle =	{36th International Symposium on Distributed Computing (DISC 2022)},
  pages =	{1:1--1:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-255-6},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{246},
  editor =	{Scheideler, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/17192},
  URN =		{urn:nbn:de:0030-drops-171920},
  doi =		{10.4230/LIPIcs.DISC.2022.1},
  annote =	{Keywords: Graph coloring, Palette Sparsification, Sublinear Algorithms}
}

Keywords: Graph coloring, Palette Sparsification, Sublinear Algorithms
Collection: 36th International Symposium on Distributed Computing (DISC 2022)
Issue Date: 2022
Date of publication: 17.10.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI