@inproceedings{a866b8f1b6924d6793866ec012b45f90,
title = "Arboricity-Dependent Algorithms for Edge Coloring",
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 {\~O}(1) update time, for any constant µ > 0, where ∆ is the maximum degree of the graph.1 In this paper, we show how to efficiently maintain a (∆ + O(α))-edge coloring in {\~O}(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.",
keywords = "Arboricity, Dynamic Algorithms, Edge Coloring, Graph Algorithms",
author = "Sayan Bhattacharya and Mart{\'i}n Costa and Nadav Panski and Shay Solomon",
note = "Publisher Copyright: {\textcopyright} Sayan Bhattacharya, Mart{\'i}n Costa, Nadav Panski, and Shay Solomon; licensed under Creative Commons License CC-BY 4.0.; 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 ; Conference date: 12-06-2024 Through 14-06-2024",
year = "2024",
month = jun,
doi = "10.4230/LIPIcs.SWAT.2024.12",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Bodlaender, {Hans L.}",
booktitle = "19th Scandinavian Symposium on Algorithm Theory, SWAT 2024",
}