Shortest path problem with multiple shortest paths

MaRDI QIDQ3170934zbMATH OpenFDO

Authors Zhijian Wang, Weiyi Han, Yijun Li

Publication date 29 September 2011

zbMATH Keywords

shortest path problemDijkstra algorithmYen algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• Shortest path methods: A unifying approach
• An Appraisal of Some Shortest-Path Algorithms
• Computing the nxm shortest path efficiently
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm

Cited in

(6)

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• A new matrix operator-based algorithm for the shortest path problem
• scientific article; zbMATH DE number 1561018 (Why is no real title available?)
• Finding the shortest paths by node combination
• The shortest path problem with two objective functions
• Finding Multi-Constrained Multiple Shortest Paths

This page was built for publication: Shortest path problem with multiple shortest paths

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