Finding the \(k\) quickest simple paths in a network (Q1322119): 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.1016/0020-0190(94)00008-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2052497422
@@ Property / OpenAlex ID: W2052497422 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding the \(k\) quickest paths in a network
+Normal rank
@@ Property / cites work @@
+The quickest path problem
@@ Property / cites work: The quickest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path algorithms: Taxonomy and annotation
@@ Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for K shortest simple paths
+Normal rank
@@ Property / cites work @@
+Algorithms for the quickest path problem and the enumeration of quickest paths
+Normal rank
@@ Property / cites work @@
+Finding the <i>K</i> Shortest Loopless Paths in a Network
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1322119