"Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time."

Xiao Mao (2024)

> Home

Details and statistics

DOI: 10.1145/3618260.3649695

access: closed

type: Conference or Workshop Paper

metadata version: 2024-06-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Mao24a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Mao24a
Xiao Mao:
Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time. STOC 2024: 1141-1152

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.