Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.
Bapi ChatterjeeSathya PeriMuktikanta SaKomma ManognaPublished in: OPODIS (2021)
Keyphrases
- worst case
- upper bound
- average case
- lower bound
- approximation algorithms
- error bounds
- np hard
- greedy algorithm
- running times
- worst case bounds
- worst case analysis
- upper and lower bounds
- theoretical guarantees
- space complexity
- computational complexity
- dynamic networks
- graph matching
- vc dimension
- memory space
- complexity bounds
- loss bounds
- dynamic graph