Pages that link to "Item:Q5951977"
From MaRDI portal
The following pages link to Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977):
Displaying 11 items.
- 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)
- 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)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← 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)
- Parametric matroid interdiction (Q6122085) (← links)
