New space efficient method for streaming graph coloring decisions
Improved Space Bounds for Promise Graph Coloring in Adversarial Streams
Data Structures and AlgorithmsComputational Complexity
Summary
Choosing colors for a network's points without using many computers’ memory is tough, especially when the data arrives all at once and can be tricky. The authors found a way to use less memory to tell if a network can be colored with 3 or more colors in a single pass. They improved older methods and also showed limits on how little memory can be used for certain coloring problems. This helps solve some open questions about graph coloring in data streams.
What this means in practice
- •For network engineers: Detect if a network’s structure can be managed with limited color assignments using less memory during real-time monitoring of network topologies.
- •For database system developers: Implement memory-efficient routines for query planning and optimization that rely on coloring properties of graph-structured data streams.
A theory result. No direct application yet.
Authors
Sergio Thoumi
Abstract
We study promise graph coloring in one pass insertion-only adversarial streams. We give a randomized algorithm that distinguishes 3-colorable graphs from graphs that are not 6-colorable using $O(n^{3/2}\log(n/\varepsilon)\log n)$ bits of space. This provides a truly subquadratic space algorithm for a constant coloring gap, answering an open problem posed by Assadi, Sundaresan, and Yazdanyar [SODA 2026] for $q=3$. Combining this algorithm with the vertex-sampling lemma of Assadi et al.\ yields, for any $144\lceil\log_2 n\rceil\le Q\le n$, a one-pass decision algorithm distinguishing $3$-colorable graphs from graphs that are not $Q$-colorable using $O((n/Q)^{3/2}\log^5 n)$ bits of space. This improves upon the $\widetilde{O}((n/Q)^2)$ bound achievable via dynamic streaming techniques. Setting $Q=\lceil n^{1/3}\rceil$ yields a semi-streaming decision algorithm, answering the decision version of another open problem posed by Assadi et al. On the negative side, we prove that distinguishing $χ(G)\le q$ from $χ(G)\ge(q-1)^2$ requires $Ω(n^2/q^5)$ bits of space, improving upon the previously established $q^2/4$ threshold using the same space complexity.