Login / Signup
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter.
Amir Abboud
Fabrizio Grandoni
Virginia Vassilevska Williams
Published in:
SODA (2015)
Keyphrases
</>
problems involving
optimization problems
solving problems
connected components
genetic algorithm
benchmark problems
application domains
random walk
np complete
relational databases
reinforcement learning
database
linear programming
weighted graph
social networks
graph representation
shortest path problem