New algorithms and hardness for incremental single-source shortest paths in directed graphs.

Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein

Browse the full STOC paper archive.