Pages that link to "Item:Q4628044"
From MaRDI portal
The following pages link to A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044):
Displaying 11 items.
- A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes (Q3611946) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- (Q6087208) (← links)
- Assistance and interdiction problems on interval graphs (Q6094722) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
