Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. Henzinger, M., Krinninger, S., & Nanongkai, D. In Proceedings of Foundations of Computer Science (FOCS), pages 146-155, 2014.
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time [link]Paper  bibtex   
@inproceedings{ dblp1605999,
  title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time},
  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 = {dblp1605999},
  id = {dblp1605999},
  biburl = {http://www.dblp.org/rec/bibtex/conf/focs/HenzingerKN14},
  url = {http://dx.doi.org/10.1109/FOCS.2014.24},
  conference = {FOCS},
  pages = {146-155},
  text = {FOCS 2014:146-155},
  booktitle = {Proceedings of Foundations of Computer Science (FOCS)}
}

Downloads: 0