C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity.
Ran Duan
Le Zhang
Published in:
WADS (2017)
Keyphrases
</>
worst case
dynamically updated
lower bound
search space
upper bound
np hard
data sets
error bounds
average case
times faster
connected components
randomized algorithms
worst case scenario