Document Open Access Logo

Arboricity-Dependent Algorithms for Edge Coloring

Authors Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon

PDF
Thumbnail PDF

File

LIPIcs.SWAT.2024.12.pdf
  • Filesize: 0.72 MB
  • 15 pages

Document Identifiers

Author Details

Sayan Bhattacharya
  • University of Warwick, UK
Martín Costa
  • University of Warwick, UK
Nadav Panski
  • Tel Aviv University, Israel
Shay Solomon
  • Tel Aviv University, Israel

Funding

Shay Solomon is funded by the European Union (ERC, DynOpt, 101043159). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. Shay Solomon and Nadav Panski are supported by the Israel Science Foundation (ISF) grant No.1991/1. Shay Solomon is also supported by a grant from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel, and the United States National Science Foundation (NSF).

Cite AsGet BibTex

Sayan Bhattacharya, Martín Costa, Nadav Panski, and Shay Solomon. Arboricity-Dependent Algorithms for Edge Coloring. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SWAT.2024.12

Abstract

The problem of edge coloring has been extensively studied over the years. Recently, this problem has received significant attention in the dynamic setting, where we are given a dynamic graph evolving via a sequence of edge insertions and deletions and our objective is to maintain an edge coloring of the graph. Currently, it is not known whether it is possible to maintain a (Δ + O(Δ^(1-μ)))-edge coloring in Õ(1) update time, for any constant μ > 0, where Δ is the maximum degree of the graph. In this paper, we show how to efficiently maintain a (Δ + O(α))-edge coloring in Õ(1) amortized update time, where α is the arboricty of the graph. Thus, we answer this question in the affirmative for graphs of sufficiently small arboricity.

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic graph algorithms
Keywords
  • Dynamic Algorithms
  • Graph Algorithms
  • Edge Coloring
  • Arboricity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Leonid Barenboim, Michael Elkin, and Tzalik Maimon. Deterministic distributed (Δ + o(Δ))-edge-coloring, and vertex-coloring of graphs with bounded diversity. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 175-184. ACM, 2017. Google Scholar
  2. Leonid Barenboim and Tzalik Maimon. Fully-dynamic graph algorithms with sublinear time inspired by distributed computing. In International Conference on Computational Science, ICCS 2017, 12-14 June 2017, Zurich, Switzerland, volume 108 of Procedia Computer Science, pages 89-98. Elsevier, 2017. Google Scholar
  3. Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, and Danupon Nanongkai. Dynamic algorithms for graph coloring. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1-20. SIAM, 2018. Google Scholar
  4. Sayan Bhattacharya, Martín Costa, Nadav Panski, and Shay Solomon. Density-sensitive algorithms for (Δ + 1)-edge coloring. CoRR, abs/2307.02415, 2023. URL: https://arxiv.org/abs/2307.02415.
  5. Sayan Bhattacharya, Martín Costa, Nadav Panski, and Shay Solomon. Nibbling at long cycles: Dynamic (and static) edge coloring in optimal time. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3393-3440. SIAM, 2024. Google Scholar
  6. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos E. Tsourakakis. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 173-182. ACM, 2015. Google Scholar
  7. Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, and Jara Uitto. The complexity of distributed edge coloring with small palettes. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 2633-2652. SIAM, 2018. Google Scholar
  8. Norishige Chiba and Takao Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210-223, 1985. Google Scholar
  9. Aleksander B. J. Christiansen, Eva Rotenberg, and Juliette Vlieghe. Sparsity-parameterised dynamic edge colouring. CoRR, abs/2311.10616, 2023. URL: https://arxiv.org/abs/2311.10616.
  10. Aleksander Bjørn Grodt Christiansen. The power of multi-step vizing chains. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), pages 1013-1026, 2023. Google Scholar
  11. Ran Duan, Haoqing He, and Tianyi Zhang. Dynamic edge coloring with improved approximation. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 1937-1945. SIAM, 2019. Google Scholar
  12. Łukasz Kowalik. Edge-coloring sparse graphs with Δ colors in quasilinear time. arXiv preprint, 2024. URL: https://arxiv.org/abs/2401.13839.
  13. V. G. Vizing. On an estimate of the chromatic class of a p-graph. Discret Analiz, 3:25-30, 1964. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact