Login / Signup

Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity.

Ran DuanLe 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