Fine-Grained Optimality of Partially Dynamic Shortest Paths and More

Single Source Shortest Paths ($\textrm{SSSP}$) is among the most well-studied problems in computer science. In the incremental (resp. decremental) setting, the goal is to maintain distances from a fixed source in a graph undergoing edge insertions (resp. deletions). A long line of research culminate...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Saha, Barna, Williams, Virginia Vassilevska, Xu, Yinzhan, Ye, Christopher
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!