Finding the k most vital edges in the minimum spanning tree problem

DOI10.1016/S0167-8191(97)00098-7zbMath0903.68135OpenAlexW2042373356MaRDI QIDQ1127438

Weifa Liang, Xiao-Jun Shen

Publication date: 13 August 1998

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(97)00098-7

zbMATH Keywords

network optimizationcombinatorial algorithmsminimum spanning treesNC algorithmsmost vital edges

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Parametric matroid interdiction ⋮ Blocking optimal arborescences ⋮ Blocking unions of arborescences ⋮ Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem ⋮ Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)

This page was built for publication: Finding the k most vital edges in the minimum spanning tree problem