Algorithms and Hardness for Diameter in Dynamic Graphs.

Bertie Ancona Monika Henzinger Liam Roditty Virginia Vassilevska Williams Nicole Wein

Published in: CoRR (2018)

Keyphrases

computational complexity
graph theory
orders of magnitude
significant improvement
graph isomorphism
learning algorithm
worst case
dynamic environments
theoretical analysis
times faster
neural network
lower bound
optimization problems
learning theory
maximal cliques
polynomial time complexity