Computing and Listing st-Paths in Public Transportation Networks (Q5740180): Difference between revisions

@@ Property / cites work @@
+Q5397839
@@ Property / cites work: Q5397839 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2847380
@@ Property / cites work: Q2847380 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the k Shortest Paths
@@ Property / cites work: Finding the k Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All the Elementary Circuits of a Directed Graph
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for K shortest simple paths
+Normal rank
@@ Property / cites work @@
+A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Efficiently Listing Bounded Length st-Paths
@@ Property / cites work: Efficiently Listing Bounded Length st-Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q4707785
@@ Property / cites work: Q4707785 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the <i>K</i> Shortest Loopless Paths in a Network
+Normal rank