Fully dynamic graph algorithms inspired by distributed computing: Deterministic maximal matching and edge coloring in sublinear update-time

Leonid Barenboim, Tzalik Maimon

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'Fully dynamic graph algorithms inspired by distributed computing: Deterministic maximal matching and edge coloring in sublinear update-time'. Together they form a unique fingerprint.

Mathematics