Database Paper Browser

Back to papers

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
1900
Venue
PODS
Year
2023
Pagerank
4.427232e-05
Overall Rank
8,905 | 38.05%
DOI
10.1145/3584372.3588681

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,353 Perfect Sampling in Turnstile Streams Beyond Small Moments 2025 PODS 4.1945683e-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,172 The Adversarial Robustness of Sampling 2020 PODS 6.3879072e-05
4,403 A Framework for Adversarially Robust Streaming Algorithms 2020 PODS 6.2194225e-05
5,392 Coloring Away Communication in Parallel Query Optimization 1995 VLDB 5.5329138e-05
Previous Page 1 / 1 Next

Semantically Similar Papers