Deterministic graph coloring in the streaming model-Reference-Cited by-同舟云学术

Deterministic graph coloring in the streaming model

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¹,Chen Andrew²,Sun Glenn³

Affiliation:

1. Rutgers University, USA

2. Cornell University, USA

3. University of California at Los Angeles, USA

Publisher

ACM

Link

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

Reference34 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. 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.

3. Sublinear Algorithms for (Δ + 1) Vertex Coloring

4. Sepehr Assadi and Aditi Dudeja . 2021. Ruling Sets in Random Order and Adversarial Streams . In 35th International Symposium on Distributed Computing, DISC 2021 , October 4-8, 2021, Freiburg, Germany (Virtual Conference), Seth Gilbert (Ed.) (LIPIcs , Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1–6: 18 . Sepehr Assadi and Aditi Dudeja. 2021. Ruling Sets in Random Order and Adversarial Streams. In 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), Seth Gilbert (Ed.) (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1–6:18.

5. Sepehr Assadi and Aditi Dudeja . 2021 . A Simple Semi-Streaming Algorithm for Global Minimum Cuts . In 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference , January 11-12, 2021, Hung Viet Le and Valerie King (Eds.). SIAM, 172–180. Sepehr Assadi and Aditi Dudeja. 2021. A Simple Semi-Streaming Algorithm for Global Minimum Cuts. In 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, Hung Viet Le and Valerie King (Eds.). SIAM, 172–180.

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

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

2. 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