Pages that link to "Item:Q1183410"
From MaRDI portal
The following pages link to Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410):
Displaying 15 items.
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Super edge magic graceful graphs (Q508670) (← links)
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
- Efficient algorithms for finding the most vital edge of a minimum spanning tree (Q1313724) (← links)
- The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup> (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)
- Globally and locally minimal weight spanning tree networks (Q5949742) (← links)
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
