Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
type: Item
instance of: scholarly article
title: Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
zbMATH Open document ID: 1251.90370
author: Cristina Bazgan
author: Sonia Toubaline
author: Daniel Vanderpooten
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6106640
zbMATH Keywords: most vital edges
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: exact algorithms
zbMATH Keywords: mixed integer program
MaRDI profile type: Publication
full work available at URL: j.cor.2012.02.023
OpenAlex ID: W2092574579
cites work: Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity
cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
cites work: Q4875228
cites work: Finding the most vital edge with respect to minimum spanning tree in weighted graphs
cites work: Efficient algorithms for finding the most vital edge of a minimum spanning tree
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
cites work: Finding the k most vital edges in the minimum spanning tree problem
cites work: Q4845371
cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
cites work: A faster computation of the most vital edge of a shortest path
cites work: Algorithms and Computation
cites work: An optimal minimum spanning tree algorithm
cites work: Finding the n Most Vital Links in Flow Networks
cites work: Finding the \(k\) most vital edges with respect to minimum spanning tree
cites work: Applications of Path Compression on Balanced Trees
cites work: Removing Arcs from a Network
cites work: Deterministic network interdiction
DOI: 10.1016/J.COR.2012.02.023
description: scientific article; zbMATH DE number 6106640