A new shortest path updating algorithm

DOI10.1002/net.3230080406zbMath0392.94022OpenAlexW2005395736MaRDI QIDQ4174636

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) Circuits, networks (94C99) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

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

Cites Work

• Unnamed Item
• Sparse matrices

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