Shortest-path algorithms: Taxonomy and annotation (Q3330993): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.3230140208
+Normal rank
@@ Property / OpenAlex ID @@
+W2063317962
@@ Property / OpenAlex ID: W2063317962 / rank @@
+Normal rank
@@ Property / cites work @@
+On the determination of the shortes path in a network having gains
+Normal rank
@@ Property / cites work @@
+Calculating<i>K</i>th Shortest Paths
@@ Property / cites work: Calculating<i>K</i>th Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse matrix techniques for the shortest path problem
+Normal rank
@@ Property / cites work @@
+A Method for the Solution of the             <i>N</i>             th Best Path Problem
+Normal rank
@@ Property / cites work @@
+A Note on Dijkstra's Shortest Path Algorithm
@@ Property / cites work: A Note on Dijkstra's Shortest Path Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Determination of shortest path in a network with time-dependent edge-lengths<sup>1</sup>
+Normal rank
@@ Property / cites work @@
+Q5578544
@@ Property / cites work: Q5578544 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Shortest Route between Two Points in a Network
+Normal rank
@@ Property / cites work @@
+Some Computational Notes on the Shortest Route Problem
+Normal rank
@@ Property / cites work @@
+Computational experience with an algorithm for finding the k shortest paths in a network
+Normal rank
@@ Property / cites work @@
+A Shortest Path Algorithm for Edge-Sparse Graphs
@@ Property / cites work: A Shortest Path Algorithm for Edge-Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in             <i>N</i>             -Node Nonnegative-Distance Networks
+Normal rank
@@ Property / cites work @@
+Finding the Lengths of All Shortest paths in             <i>N</i>             -Node Nonnegative-Distance Complete Networks Using ½             <i>               N               <sup>3</sup>             </i>             Additions and             <i>               N               <sup>3</sup>             </i>             Comparisons
+Normal rank