Finding the most vital node of a shortest path. (Q1401266): Difference between revisions

@@ Property / cites work @@
+Finding the most vital arcs in a network
@@ Property / cites work: Finding the most vital arcs in a network / rank @@
+Normal rank
@@ Property / cites work @@
+Most vital links and nodes in weighted networks
@@ Property / cites work: Most vital links and nodes in weighted networks / 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 @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+Normal rank
@@ Property / cites work @@
+Finding the detour-critical edge of a shortest path between two nodes
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Algorithmic mechanism design (extended abstract)
@@ Property / cites work: Algorithmic mechanism design (extended abstract) / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+NC algorithms for the Single Most Vital Edge problem with respect to shortest paths
+Normal rank