Loading...

Simple streaming algorithms for edge coloring

Ansari, M ; Sharif University of Technology | 2022

84 Viewed
  1. Type of Document: Article
  2. DOI: 10.4230/LIPIcs.ESA.2022.8
  3. Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 2022
  4. Abstract:
  5. We revisit the classical edge coloring problem for general graphs in the streaming model. In this model, the input graph is presented as a stream of edges, and the algorithm must report colors assigned to the edges in a streaming fashion, using a memory of size O(n polylog n) on graphs of up to O(n2) edges. In ESA 2019 and SOSA 2021, two elegant randomized algorithms were presented for this problem in the adversarial edge arrival model, where the latest one colors any input graph using O(Δ2/s) colors with high probability in O (ns) space. In this short note, we propose two extremely simple streaming algorithms that achieve the same color and space bounds deterministically. Besides being surprisingly simple, our algorithms do not use randomness at all, and are very simple to analyze. © 2022 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved
  6. Keywords:
  7. Adversarial order ; Edge coloring ; Edge-coloring problem ; Edge-colouring ; General graph ; Input graphs ; Polylogs ; Randomized Algorithms ; Simple++ ; Streaming algorithm ; Streaming model ; Color
  8. Source: 30th Annual European Symposium on Algorithms, ESA 2022, 5 September 2022 through 9 September 2022 ; Volume 244 , 2022 ; 18688969 (ISSN); 9783959772471 (ISBN)
  9. URL: https://drops.dagstuhl.de/opus/volltexte/2022/16946/pdf/LIPIcs-ESA-2022-8.pdf