Dynamic shortest path algorithm based on variable weight

DOI10.13568/J.CNKI.651094.2015.03.017MaRDI QIDQ2991040zbMATH OpenFDO

Authors Xiaojie Wang, Jianguo Tang, Juan Li

Publication date 10 August 2016

Full work available at URL https://doi.org/10.13568/J.CNKI.651094.2015.03.017

zbMATH Keywords

dynamic updaterouting protocolshortest pathSPT algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• Shortest paths on dynamic graphs
• scientific article; zbMATH DE number 30302
• Shortest-path algorithms and dynamic cost changes
• On-line and dynamic algorithms for shortest path problems

Cited in

(2)

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• Improvement of A^* algorithm and its application in shortest path problem in dynamic networks

This page was built for publication: Dynamic shortest path algorithm based on variable weight

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