Pages that link to "Item:Q1634092"
From MaRDI portal
The following pages link to Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092):
Displaying 8 items.
- Minimum cost edge blocker clique problem (Q827246) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Assistance and interdiction problems on interval graphs (Q6094722) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)