Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs

Article Details
Title:	Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs
Article URLs:	https://doi.org/10.1137/1.9781611974782.29 http://dl.acm.org/citation.cfm?id=3039715
Alternative Article URLs:
Authors:	Aaron Bernstein	Technische Universität Berlin, Department of Mathematics
Authors:	Shiri Chechik	Tel Aviv University, Department of Computer Science
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/soda/BernsteinC17
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2017