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. 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
{"_id":"sJPwhKSmpqQmtBEYR","bibbaseid":"henzinger-krinninger-nanongkai-decrementalsinglesourceshortestpathsonundirectedgraphsinnearlineartotalupdatetime-2014","downloads":0,"creationDate":"2015-02-04T20:17:52.635Z","title":"Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time","author_short":["Henzinger, M.","Krinninger, S.","Nanongkai, D."],"year":2014,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/focs/HenzingerKN14","bibdata":{"title":"Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time","author":["Monika Henzinger","Sebastian Krinninger","Danupon Nanongkai"],"author_short":["Henzinger, M.","Krinninger, S.","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)","bibtex":"@inproceedings{ dblp1605999,\n title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time},\n author = {Monika Henzinger and Sebastian Krinninger and Danupon Nanongkai},\n author_short = {Henzinger, M. and Krinninger, S. and Nanongkai, D.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2014},\n key = {dblp1605999},\n id = {dblp1605999},\n biburl = {http://www.dblp.org/rec/bibtex/conf/focs/HenzingerKN14},\n url = {http://dx.doi.org/10.1109/FOCS.2014.24},\n conference = {FOCS},\n pages = {146-155},\n text = {FOCS 2014:146-155},\n booktitle = {Proceedings of Foundations of Computer Science (FOCS)}\n}","bibbaseid":"henzinger-krinninger-nanongkai-decrementalsinglesourceshortestpathsonundirectedgraphsinnearlineartotalupdatetime-2014","role":"author","urls":{"Paper":"http://dx.doi.org/10.1109/FOCS.2014.24"},"downloads":0},"search_terms":["decremental","single","source","shortest","paths","undirected","graphs","near","linear","total","update","time","henzinger","krinninger","nanongkai"],"keywords":[],"authorIDs":[],"dataSources":["kDxSEoGTFo2b2Lcum"]}