<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:37:07Z</responseDate>
  <request identifier="26445" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:26445</identifier>
        <datestamp>2026-07-01T07:16:11Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Faster Deterministic Streaming Vertex Coloring</dc:title>
          <dc:creator>Chechik, Shiri</dc:creator>
          <dc:creator>Chen, Hongyi</dc:creator>
          <dc:creator>Zhang, Tianyi</dc:creator>
          <dc:subject>vertex coloring</dc:subject>
          <dc:subject>streaming</dc:subject>
          <dc:description>Graph coloring is a fundamental problem in computer science. In the semi-streaming model, an input graph G on n vertices and maximum degree Δ is presented as a stream of edges, and the goal is to compute a vertex coloring using a small number of colors while storing only Õ(n) bits of memory.&#13;
Recent work has revealed an exponential separation between randomized and deterministic approaches in this setting: while randomized algorithms can achieve a (Δ+1)-coloring in a single pass [Assadi, Chen, and Khanna, 2019], any single-pass deterministic algorithm requires exp(Δ^Ω(1)) colors [Assadi, Chen, and Sun, 2022]. Consequently, deterministic algorithms that use few colors must necessarily make multiple passes over the stream. Prior to this work, the best known deterministic trade-offs were: an O(Δ²)-coloring in 2 passes, an O(Δ)-coloring in O(log Δ) passes [Assadi, Chen, and Sun, 2022], and a (Δ+1)-coloring in O(log Δ ⋅ log log Δ) passes [Assadi, Chakrabarti, Ghosh, and Stoeckl, 2023]. It remained open whether better trade-offs - particularly with sub-logarithmic pass complexity and linear-in-Δ palette size - were achievable.&#13;
In this paper, we present a new deterministic semi-streaming algorithm that computes an O(Δ)-coloring in O(√{log Δ}) passes. This is the first deterministic streaming algorithm to achieve a coloring with palette size linear-in-Δ using sublogarithmic-in-Δ passes.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Shiri Chechik and Hongyi Chen and Tianyi Zhang</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 374, 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.ICALP.2026.56</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-264453</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.56</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
