Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time

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]

Abstract

Abstract is missing.