Orienting Fully Dynamic Graphs with Worst-Case Time Bounds.
Tsvi KopelowitzRobert KrauthgamerEly PoratShay SolomonPublished in: CoRR (2013)
Keyphrases
- worst case
- upper bound
- average case
- lower bound
- error bounds
- dynamic networks
- dynamic environments
- upper and lower bounds
- np hard
- sample size
- pairwise
- graph matching
- approximation algorithms
- multi class
- greedy algorithm
- graph mining
- space complexity
- graph representation
- lower and upper bounds
- computational complexity
- neural network