Algorithms and Hardness for Diameter in Dynamic Graphs.

Bertie Ancona Monika Henzinger Liam Roditty Virginia Vassilevska Williams Nicole Wein

Published in: ICALP (2019)

Keyphrases

computational complexity
worst case
learning algorithm
computational cost
graph theory
significant improvement
theoretical analysis
orders of magnitude
dynamic graph
data mining
minimum spanning tree
graph mining
machine learning algorithms
computationally efficient
optimization problems
np hard
data structure