Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring-Reference-Cited by-同舟云学术

Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Assadi Sepehr¹,Kumar Pankaj²,Mittal Parth¹

Affiliation:

1. Rutgers University, USA

2. Charles University in Prague, Czechia

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520005

Reference56 articles.

1. Amir Abboud , Keren Censor-Hillel , Seri Khoury , and Ami Paz . 2019. Smaller Cuts , Higher Lower Bounds. CoRR, abs/1901.01630 ( 2019 ). Amir Abboud, Keren Censor-Hillel, Seri Khoury, and Ami Paz. 2019. Smaller Cuts, Higher Lower Bounds. CoRR, abs/1901.01630 (2019).

2. Analyzing Graph Structure via Linear Measurements

3. Noga Alon and Sepehr Assadi . 2020 . Palette Sparsification Beyond (Δ + 1) Vertex Coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference, Jaroslaw Byrka and Raghu Meka (Eds.) (LIPIcs , Vol. 176). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1–6: 22 . Noga Alon and Sepehr Assadi. 2020. Palette Sparsification Beyond (Δ + 1) Vertex Coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference, Jaroslaw Byrka and Raghu Meka (Eds.) (LIPIcs, Vol. 176). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1–6:22.

4. Colorings and orientations of graphs

5. Sepehr Assadi , Andrew Chen , and Glenn Sun . 2021.. Deterministic Graph Coloring in the Streaming Model. CoRR, abs/2109.14891. To appear in STOC 2022 ( 2021 .), arXiv:2109.14891.. arxiv:2109.14891 Sepehr Assadi, Andrew Chen, and Glenn Sun. 2021.. Deterministic Graph Coloring in the Streaming Model. CoRR, abs/2109.14891. To appear in STOC 2022 (2021.), arXiv:2109.14891.. arxiv:2109.14891

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sketching Approximability of All Finite CSPs;Journal of the ACM;2024-04-12

2. Recent Advances in Multi-Pass Graph Streaming Lower Bounds;ACM SIGACT News;2023-09-07

3. Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18

4. Coloring Fast with Broadcasts;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

5. Distributed Coloring of Hypergraphs;Structural Information and Communication Complexity;2023