A simple algorithm for replacement paths problem (Q327668): Difference between revisions

@@ Property / cites work @@
+Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
+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 @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Replacement Paths via Row Minima of Concise Matrices
+Normal rank
@@ Property / cites work @@
+Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Finding the most vital node of a shortest path.
@@ Property / cites work: Finding the most vital node of a shortest path. / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
+Normal rank
@@ Property / cites work @@
+Floats, Integers, and Single Source Shortest Paths
+Normal rank