Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
Summary: Deterministic semi-streaming algorithm achieves combinatorially optimal (Δ+1)-coloring in O(log Δ · log log Δ) passes, improving prior O(Δ)-coloring. Adversarially-robust semi-streaming reduced colors to O(Δ^{5/2}) with improved colors/space tradeoffs (e.g., O(Δ^2) colors in O(n·Δ^{1/3}) space). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sepehr Assadi (Rutgers University)
- 2. Amit Chakrabarti (Dartmouth College)
- 3. Prantar Ghosh (Rutgers University)
- 4. Manuel Stoeckl (Dartmouth College)
BibTeX Citation
@inproceedings{assadi_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588681},
doi = {10.1145/3584372.3588681},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Assadi, Sepehr and Chakrabarti, Amit and Ghosh, Prantar and Stoeckl, Manuel},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,159 | Perfect Sampling in Turnstile Streams Beyond Small Moments | 2025 | PODS | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,322 | The Adversarial Robustness of Sampling | 2020 | PODS | 6.6514924e-05 |
| 4,390 | A Framework for Adversarially Robust Streaming Algorithms | 2020 | PODS | 6.6110397e-05 |
| 5,599 | Coloring Away Communication in Parallel Query Optimization | 1995 | VLDB | 6.0535576e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,378 | Streaming Algorithms for Robust Distinct Elements | 2016 | SIGMOD |
| 2 | 10,841 | Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It | 2026 | VLDB |
| 3 | 5,258 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS |
| 4 | 9,118 | How the Degeneracy Helps for Triangle Counting in Graph Streams | 2020 | PODS |
| 5 | 9,810 | Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation | 2025 | VLDB |
| 6 | 11,890 | The White-Box Adversarial Data Stream Model | 2022 | PODS |
| 7 | 11,864 | Quasi-stable Coloring for Graph Compression | 2023 | VLDB |
| 8 | 4,390 | A Framework for Adversarially Robust Streaming Algorithms | 2020 | PODS |
| 9 | 5,790 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB |
| 10 | 11,879 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |