Minimum edge blocker dominating set problem (Q319914): Difference between revisions

@@ Property / author @@
-Vladimir L. Boginski
@@ Property / author: Vladimir L. Boginski / rank @@
-Normal rank
@@ Property / author @@
+Vladimir L. Boginski
@@ Property / author: Vladimir L. Boginski / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SparseMatrix
@@ Property / describes a project that uses: SparseMatrix / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2015.05.037
+Normal rank
@@ Property / OpenAlex ID @@
+W1949782199
@@ Property / OpenAlex ID: W1949782199 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
+Normal rank
@@ Property / cites work @@
+The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
+Normal rank
@@ Property / cites work @@
+Detecting critical nodes in sparse graphs
@@ Property / cites work: Detecting critical nodes in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination alteration sets in graphs
@@ Property / cites work: Domination alteration sets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The most vital nodes with respect to independent set and vertex cover
+Normal rank
@@ Property / cites work @@
+Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
+Normal rank
@@ Property / cites work @@
+Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Complexity of the critical node problem over trees
+Normal rank
@@ Property / cites work @@
+Branch and cut algorithms for detecting critical nodes in undirected graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for minimum CDS with shortest path constraint in wireless networks
+Normal rank
@@ Property / cites work @@
+The bondage number of a graph
@@ Property / cites work: The bondage number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875228
@@ Property / cites work: Q4875228 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal interdiction policy for a flow network
@@ Property / cites work: Optimal interdiction policy for a flow network / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the bondage and reinforcement problems
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum vertex blocker clique problem
@@ Property / cites work: Minimum vertex blocker clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
+Normal rank
@@ Property / cites work @@
+Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+An integer programming framework for critical elements detection in graphs
+Normal rank
@@ Property / cites work @@
+Removing Arcs from a Network
@@ Property / cites work: Removing Arcs from a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Wireless networking, dominating and packing
@@ Property / cites work: Wireless networking, dominating and packing / rank @@
+Normal rank
@@ Property / cites work @@
+On bondage numbers of graphs: a survey with some comments
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Blockers and transversals
@@ Property / cites work: Blockers and transversals / rank @@
+Normal rank
@@ Property / cites work @@
+New dominating sets in social networks
@@ Property / cites work: New dominating sets in social networks / rank @@
+Normal rank