On designing networks resilient to clique blockers

Cites Work

Unnamed Item
Minimum edge blocker dominating set problem
A class of algorithms for mixed-integer bilevel min-max optimization
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
An integer programming framework for critical elements detection in graphs
The most vital nodes with respect to independent set and vertex cover
Complexity of the critical node problem over trees
Matching interdiction
On short paths interdiction problems: Total and node-wise limited interdiction
Network flow interdiction on planar graphs
Detecting critical nodes in sparse graphs
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
The most vital edges in the minimum spanning tree problem
The maximum clique problem
Exact algorithms for the minimum cost vertex blocker clique problem
The maximum clique interdiction problem
Deterministic network interdiction
Propositional truth maintenance systems: Classification and complexity analysis
Branch and cut algorithms for detecting critical nodes in undirected graphs
The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
Exact identification of critical nodes in sparse networks via new compact formulations
A review on algorithms for maximum clique problems
Two extended formulations for cardinality maximum flow network interdiction problem
Minimum vertex blocker clique problem
Shortest-path network interdiction
Increasing the Weight of Minimum Spanning Trees
Integer Programming Formulations for Minimum Spanning Tree Interdiction
Finding Critical Links for Closeness Centrality
Removing Arcs from a Network
Optimal interdiction policy for a flow network

This page was built for publication: On designing networks resilient to clique blockers