Finding the \(k\) most vital edges with respect to minimum spanning tree
From MaRDI portal
Publication:1806175
DOI10.1007/s002360050166zbMath0932.68071OpenAlexW2076304834MaRDI QIDQ1806175
Publication date: 20 December 1999
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050166
Related Items (6)
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation ⋮ Parametric matroid interdiction ⋮ Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures ⋮ 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\) ⋮ Epidemics on small worlds of tree-based wireless sensor networks
Uses Software
This page was built for publication: Finding the \(k\) most vital edges with respect to minimum spanning tree
