Pages that link to "Item:Q1313724"

The following pages link to Efficient algorithms for finding the most vital edge of a minimum spanning tree (Q1313724):

Displaying 12 items.

• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
• NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
• Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← 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)
• The swap edges of a multiple-sources routing tree (Q2479532) (← links)
• An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗ (Q4511611) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
• Parametric matroid interdiction (Q6122085) (← links)