Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915663832940544 |
|---|---|
| author | Hutton, Chase Melrod, Adam |
| author_facet | Hutton, Chase Melrod, Adam |
| contents | We present the first parallel batch-dynamic algorithm for maintaining a proper $(Δ+ 1)$-vertex coloring. Our approach builds on a new sequential dynamic algorithm inspired by the work of Bhattacharya et al. (SODA'18). The resulting randomized algorithm achieves $O(\log Δ)$ expected amortized update time and, for any batch of $b$ updates, has parallel span $O(\operatorname{polylog} b + \operatorname{polylog} n)$ with high probability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_08742 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time Hutton, Chase Melrod, Adam Data Structures and Algorithms Distributed, Parallel, and Cluster Computing We present the first parallel batch-dynamic algorithm for maintaining a proper $(Δ+ 1)$-vertex coloring. Our approach builds on a new sequential dynamic algorithm inspired by the work of Bhattacharya et al. (SODA'18). The resulting randomized algorithm achieves $O(\log Δ)$ expected amortized update time and, for any batch of $b$ updates, has parallel span $O(\operatorname{polylog} b + \operatorname{polylog} n)$ with high probability. |
| title | Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time |
| topic | Data Structures and Algorithms Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2512.08742 |