Login / Signup
Fully dynamic all-pairs shortest paths with worst-case update-time revisited.
Ittai Abraham
Shiri Chechik
Sebastian Krinninger
Published in:
SODA (2017)
Keyphrases
</>
worst case
lower bound
average case
dynamically updated
databases
clustering algorithm
learning algorithm
upper bound
dynamically changing
image processing
face recognition
expert systems
information technology
dynamic environments
space complexity