Login / Signup
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds.
Tsvi Kopelowitz
Robert Krauthgamer
Ely Porat
Shay Solomon
Published in:
ICALP (2) (2014)
Keyphrases
</>
worst case
upper bound
lower bound
average case
error bounds
dynamic environments
graph theoretic
graph theory
worst case bounds
dynamic graph
graph databases
data sets
np hard
graph representation
greedy algorithm
dynamic networks
worst case analysis
graph model
special case
search algorithm