Pages that link to "Item:Q1806175"
From MaRDI portal
The following pages link to Finding the \(k\) most vital edges with respect to minimum spanning tree (Q1806175):
Displaying 6 items.
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Epidemics on small worlds of tree-based wireless sensor networks (Q2341582) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
