Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem

DOI10.1007/978-3-642-22616-8_11zbMath1342.05178OpenAlexW1833577439MaRDI QIDQ5199145

Daniel Vanderpooten, Sonia Toubaline, Cristina Bazgan

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_11

zbMATH Keywords

minimum spanning treeexact algorithmsmixed integer programmost vital edges

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

This page was built for publication: Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem