NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229): Difference between revisions

@@ Property / cites work @@
+Finding the most vital edge with respect to minimum spanning tree in weighted graphs
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding the most vital edge of a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+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 @@
+Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup>
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(96)00172-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2000869287
@@ Property / OpenAlex ID: W2000869287 / rank @@
+Normal rank