A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Trade-offs in dynamic coloring for bipartite and general graphs
[article]
2020
arXiv
pre-print
We present trade-offs in the incremental and fully dynamic settings to maintian a proper coloring. For any fully dynamic 2-coloring algorithm, the maximum of the update time, number of recolorings, and query time is Ω(log n). We present a deterministic fully dynamic 2-coloring algorithm with O(log^2 n) amortized update time, O(log n) amortized query time, and one recoloring in the worst case. For any incremental 2-coloring algorithm which explicitly maintains the color of every vertex after
arXiv:1909.07854v3
fatcat:6mcwi2nnmvgplh5elgkl5ff4hm