"Fully Dynamic Graph Algorithms Inspired by Distributed Computing: ..."

Leonid Barenboim, Tzalik Maimon (2019)

> Home

Details and statistics

DOI: 10.1145/3338529

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/BarenboimM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/BarenboimM19
Leonid Barenboim, Tzalik Maimon:
Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. ACM J. Exp. Algorithmics 24(1): 1.14:1-1.14:24 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.