The following pages link to Matching interdiction (Q602686):
Displaying 18 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Colored cut games (Q2087453) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
