Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. pages 146-155, IEEE Computer Society, 2014. [doi]

@inproceedings{HenzingerKN14-1,
  title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time},
  author = {Monika Henzinger and Sebastian Krinninger and Danupon Nanongkai},
  year = {2014},
  doi = {10.1109/FOCS.2014.24},
  url = {http://dx.doi.org/10.1109/FOCS.2014.24},
  researchr = {https://researchr.org/publication/HenzingerKN14-1},
  cites = {0},
  citedby = {0},
  pages = {146-155},
  booktitle = {55th IEEE  Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4799-6517-5},
}