Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms-Reference-Cited by-同舟云学术

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms

Published:2023-06-18 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Assadi Sepehr¹^ORCID,Chakrabarti Amit²^ORCID,Ghosh Prantar¹^ORCID,Stoeckl Manuel²^ORCID

Affiliation:

1. Rutgers University, Piscataway, NJ, USA

2. Dartmouth College, Hanover, NH, USA

Funder

Google Research Scholar Gift

National Science Foundation

Publisher

ACM

Link

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

Reference32 articles.

1. Abboud , A. , Censor-Hillel , K. , Khoury , S. , and Paz , A . Smaller cuts, higher lower bounds. CoRR abs/1901.01630 ( 2019 ). Abboud, A., Censor-Hillel, K., Khoury, S., and Paz, A. Smaller cuts, higher lower bounds. CoRR abs/1901.01630 (2019).

2. Alon , N. , and Assadi , S . Palette sparsification beyond (Δ+1) vertex coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17--19, 2020 , Virtual Conference ( 2020 ), vol. 176 of LIPIcs, pp. 6: 1 -- 6 :22. Alon, N., and Assadi, S. Palette sparsification beyond (Δ+1) vertex coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17--19, 2020, Virtual Conference (2020), vol. 176 of LIPIcs, pp. 6:1--6:22.

3. Deterministic graph coloring in the streaming model

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

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

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

1. (Δ+1) Vertex Coloring in O ( n ) Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17