Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. Henzinger, M., Krinninger, S., & Nanongkai, D. In Proceedings of Symposium on the Theory of Computing (STOC), pages 674-683, 2014.
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs [link]Paper  bibtex   
@inproceedings{ dblp1721803,
  title = {Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs},
  author = {Monika Henzinger and Sebastian Krinninger and Danupon Nanongkai},
  author_short = {Henzinger, M. and Krinninger, S. and Nanongkai, D.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2014},
  key = {dblp1721803},
  id = {dblp1721803},
  biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/HenzingerKN14},
  url = {http://doi.acm.org/10.1145/2591796.2591869},
  conference = {STOC},
  pages = {674-683},
  text = {STOC 2014:674-683},
  booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}
}

Downloads: 0