Partially dynamic single-source shortest paths on digraphs with positive weights

DOI10.1007/978-3-319-07956-1_18MaRDI QIDQ5251645zbMATH OpenOpenAlexFDO

Authors Wei Ding, Guohui Lin

Publication date 20 May 2015

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07956-1_18

zbMATH Keywords

expected timelocal searchpartially dynamicsingle-source shortest paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
• Fully dynamic shortest paths in digraphs with arbitrary arc weights
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• scientific article; zbMATH DE number 1305092
• Fully dynamic all pairs shortest paths with real edge weights

Cited in

(6)

• Partially dynamic maintenance of minimum weight hyperpaths
• Dynamic single-source shortest paths in Erdős-Rényi random graphs
• Fully dynamic shortest paths in digraphs with arbitrary arc weights
• scientific article; zbMATH DE number 7204496 (Why is no real title available?)
• Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
• Shortest paths in a diagraph with an underestimated arc weight

This page was built for publication: Partially dynamic single-source shortest paths on digraphs with positive weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251645)