Pages that link to "Item:Q2228388"
From MaRDI portal
The following pages link to Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388):
Displaying 3 items.
- A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)