Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1 Publication
2014 | Conference Paper | IST-REx-ID: 11870 | 
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In 46th Annual ACM Symposium on Theory of Computing. New York, NY, United States: Association for Computing Machinery. https://doi.org/10.1145/2591796.2591869
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv