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)

Paper ID: 1932
Venue: PODS
Year: 2023
Pagerank: 5.3251649e-05
Overall Rank: 9,060 | 37.85%
DOI: 10.1145/3584372.3588681

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
10,646	Perfect Sampling in Turnstile Streams Beyond Small Moments	2025	PODS	5.093636e-05

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,211	The Adversarial Robustness of Sampling	2020	PODS	6.8299006e-05
4,291	A Framework for Adversarially Robust Streaming Algorithms	2020	PODS	6.7786745e-05
5,451	Coloring Away Communication in Parallel Query Optimization	1995	VLDB	6.2139293e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,194	Towards Tight Bounds for the Streaming Set Cover Problem	2016	PODS
2	12,034	Streaming Algorithms for Robust Distinct Elements	2016	SIGMOD
3	5,110	Better Algorithms for Counting Triangles in Data Streams	2016	PODS
4	8,928	How the Degeneracy Helps for Triangle Counting in Graph Streams	2020	PODS
5	10,027	Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation	2025	VLDB
6	11,531	The White-Box Adversarial Data Stream Model	2022	PODS
7	11,505	Quasi-stable Coloring for Graph Compression	2023	VLDB
8	4,291	A Framework for Adversarially Robust Streaming Algorithms	2020	PODS
9	5,797	Effective and Efficient Dynamic Graph Coloring	2018	VLDB
10	11,520	Approximately Counting Subgraphs in Data Streams	2022	PODS