Pages that link to "Item:Q2920456"
From MaRDI portal
The following pages link to Parameterized Complexity of Edge Interdiction Problems (Q2920456):
Displaying 10 items.
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Matching interdiction (Q602686) (← links)
- On the hardness of covering-interdiction problems (Q2031041) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← 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)