ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
Article URLs:
Alternative Article URLs:
Authors: Monika Henzinger
  • University of Vienna, Faculty of Computer Science
Sebastian Krinninger
  • University of Vienna, Faculty of Computer Science
Danupon Nanongkai
  • Brown University, ICERM
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/HenzingerKN14
Author Comments:

Discuss this paper and its artifacts below