Finding the anti-block vital edge of a shortest path between two nodes (Q1016036): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-007-9120-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2797439625
@@ Property / OpenAlex ID: W2797439625 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138961
@@ Property / cites work: Q3138961 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for replacement paths problems in restricted graphs
+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 @@
+Q4418662
@@ Property / cites work: Q4418662 / rank @@
+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 @@
+Finding the most vital node of a shortest path.
@@ Property / cites work: Finding the most vital node of a shortest path. / rank @@
+Normal rank