Login / Signup
Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-ε})$-Time.
Danupon Nanongkai
Thatchaphol Saranurak
Published in:
CoRR (2016)
Keyphrases
</>
worst case
dynamic environments
dynamically adjust
dynamically updated
np hard
error bounds
dynamically changing
lower bound
average case
database
real time
databases
hidden markov models
upper bound
approximation algorithms