Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. pages 674-683, ACM, 2014. [doi]

@inproceedings{HenzingerKN14-0,
  title = {Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs},
  author = {Monika Henzinger and Sebastian Krinninger and Danupon Nanongkai},
  year = {2014},
  doi = {10.1145/2591796.2591869},
  url = {http://doi.acm.org/10.1145/2591796.2591869},
  researchr = {https://researchr.org/publication/HenzingerKN14-0},
  cites = {0},
  citedby = {0},
  pages = {674-683},
  booktitle = {Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014},
  editor = {David B. Shmoys},
  publisher = {ACM},
  isbn = {978-1-4503-2710-7},
}