External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Leonid Barenboim

This author has not been identified. Look up 'Leonid Barenboim' in Google

Tzalik Maimon

This author has not been identified. Look up 'Tzalik Maimon' in Google
runs on