Pages that link to "Item:Q319914"
From MaRDI portal
The following pages link to Minimum edge blocker dominating set problem (Q319914):
Displaying 15 items.
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- On blockers and transversals of maximum independent sets in co-comparability graphs (Q6585269) (← links)
