Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.
Bapi ChatterjeeSathya PeriMuktikanta SaPublished in: DISC (2021)
Keyphrases
- worst case
- upper bound
- lower bound
- average case
- error bounds
- greedy algorithm
- running times
- np hard
- approximation algorithms
- theoretical guarantees
- worst case analysis
- worst case bounds
- dynamic graph
- dynamic networks
- vc dimension
- space complexity
- sample size
- graph partitioning
- graph structure
- constant factor
- graph matching
- loss bounds
- social networks