Coloring Graphs with Few Colors in the Streaming Model
Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar

TL;DR
This paper investigates the space complexity of graph coloring in streaming models, establishing bounds for distinguishing between graphs with few colors under adversarial, random, and dynamic stream conditions, and introduces new technical tools.
Contribution
It provides the first bounds on space complexity for coloring graphs with few colors in streaming models, exploring different stream types and introducing novel techniques.
Findings
Lower bounds of near-quadratic space for certain colorability distinctions in adversarial streams.
Efficient algorithms for distinguishing between q- and q^t-colorable graphs in random order streams.
Nearly optimal bounds for distinguishing q- vs q·t-colorable graphs in dynamic streams.
Abstract
We study graph coloring problems in the streaming model, where the goal is to process an -vertex graph whose edges arrive in a stream, using a limited space that is smaller than the trivial bound. While prior work has largely focused on coloring graphs with a large number of colors, we explore the opposite end of the spectrum: deciding whether the input graph can be colored using only a few, say, a constant number of colors. We are interested in each of the adversarial, random order, or dynamic streams. Our work lays the foundation for this new direction by establishing upper and lower bounds on space complexity of key variants of the problem. Some of our main results include: - Adversarial: for distinguishing between - vs -colorable graphs, lower bounds of space for up to , and space…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Computational Geometry and Mesh Generation
