Pages that link to "Item:Q1761238"

The following pages link to Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238):

Displaying 18 items.

• Minimum edge blocker dominating set problem (Q319914) (← links)
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
• The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
• Parallel algorithms for finding the most vital edge with respect to minimum spanning tree (Q1201944) (← links)
• The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
• A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• Finding the \(k\) most vital edges with respect to minimum spanning tree (Q1806175) (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
• Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
• An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Parametric matroid interdiction (Q6122085) (← links)
• Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)