Pages that link to "Item:Q897609"
From MaRDI portal
The following pages link to Interdiction problems on planar graphs (Q897609):
Displaying 9 items.
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- On the hardness of covering-interdiction problems (Q2031041) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- (Q6084397) (← links)