Leonid Barenboim, Tzalik Maimon. Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. ACM Journal of Experimental Algorithmics, 24(1), 2019. [doi]
@article{BarenboimM19,
title = {Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time},
author = {Leonid Barenboim and Tzalik Maimon},
year = {2019},
doi = {10.1145/3338529},
url = {https://doi.org/10.1145/3338529},
researchr = {https://researchr.org/publication/BarenboimM19},
cites = {0},
citedby = {0},
journal = {ACM Journal of Experimental Algorithmics},
volume = {24},
number = {1},
}