Pages that link to "Item:Q1806175"

The following pages link to Finding the \(k\) most vital edges with respect to minimum spanning tree (Q1806175):

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)
• Finding the k most vital edges in the minimum spanning tree problem (Q1127438) (← 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)
• An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees (Q1268797) (← 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)
• (Q4551366) (← links)
• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
• Parametric matroid interdiction (Q6122085) (← links)