A new shortest path updating algorithm

DOI10.1002/NET.3230080406MaRDI QIDQ4174636zbMATH OpenOpenAlexFDO

Authors Satoshi Goto, Alberto L. Sangiovanni-Vincentelli

Publication date 1978

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230080406

zbMATH Keywords

Largescale Networks with Sparse StructureShortest Path Updating Algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Circuits, networks (94C99)

Cites work

• scientific article; zbMATH DE number 3082021 (Why is no real title available?)
• Sparse matrices

Cited in

(8)

• A reoptimization algorithm for the shortest path problem with time windows
• Optimal algorithms for sensitivity analysis in associative multiplication problems
• A special case the of dynamization problem for least cost paths
• On the computational complexity of dynamic graph problems
• A new algorithm for reoptimizing shortest paths when the arc costs change
• Anytime search in dynamic graphs
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
• Lifelong planning \(\text{A}^*\)

This page was built for publication: A new shortest path updating algorithm

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