Minimum edge blocker dominating set problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 871953 (Why is no real title available?)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks
- An integer programming framework for critical elements detection in graphs
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- Complexity of the critical node problem over trees
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Domination alteration sets in graphs
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Matching interdiction
- Minimum vertex blocker clique problem
- New dominating sets in social networks
- On bondage numbers of graphs: a survey with some comments
- On short paths interdiction problems: Total and node-wise limited interdiction
- On the complexity of the bondage and reinforcement problems
- Optimal interdiction policy for a flow network
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Removing Arcs from a Network
- Shortest-path network interdiction
- The University of Florida sparse matrix collection
- The bondage number of a graph
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The most vital nodes with respect to independent set and vertex cover
- Wireless networking, dominating and packing
Cited in
(17)- Minimum cost edge blocker clique problem
- Using edge contractions to reduce the semitotal domination number
- Detecting critical node structures on graphs: a mathematical programming approach
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Exact algorithms for the minimum cost vertex blocker clique problem
- Minimum vertex blocker clique problem
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- Integer programming methods for solving binary interdiction games
- A survey on mixed-integer programming techniques in bilevel optimization
- An order-based algorithm for minimum dominating set with application in graph mining
- Complexity and algorithms for constant diameter augmentation problems
- The complexity of blocking (semi)total dominating sets with edge contractions
- On designing networks resilient to clique blockers
- Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
This page was built for publication: Minimum edge blocker dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319914)
