Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2012.02.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2092574579
@@ Property / OpenAlex ID: W2092574579 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
+Normal rank
@@ Property / cites work @@
+Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
+Normal rank
@@ Property / cites work @@
+Q4875228
@@ Property / cites work: Q4875228 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the most vital edge with respect to minimum spanning tree in weighted graphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding the most vital edge of a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+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 @@
+Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
+Normal rank
@@ Property / cites work @@
+Finding the k most vital edges in the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal minimum spanning tree algorithm
@@ Property / cites work: An optimal minimum spanning tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Links in Flow Networks
+Normal rank
@@ Property / cites work @@
+Finding the \(k\) most vital edges with respect to minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank
@@ Property / cites work @@
+Removing Arcs from a Network
@@ Property / cites work: Removing Arcs from a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank