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

Henzinger, Monika; Krinninger, Sebastian; Nanongkai, Danupon

doi:10.1109/FOCS.2014.24

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. In R. Bilof, & M. Bartosik (Eds.), FOCS 2014 (pp. 146-155). Los Alamitos, CA: IEEE Computer Society. doi:10.1109/FOCS.2014.24.

Cite as: https://hdl.handle.net/21.11116/0000-000E-5D2E-8

Abstract

There is no abstract available