Pages that link to "Item:Q1127438"
From MaRDI portal
The following pages link to Finding the k most vital edges in the minimum spanning tree problem (Q1127438):
Displaying 11 items.
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Finding the \(k\) most vital edges with respect to minimum spanning tree (Q1806175) (← links)
- (Q4551366) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
