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

Xiao Mao

Browse the full STOC paper archive.