The critical node game
From MaRDI portal
Publication:6645160
DOI10.1007/S10878-024-01173-3MaRDI QIDQ6645160
Andrea Lodi, Gabriele Dragotto, Mehdi Taobane, Amine Boukhtouta
Publication date: 28 November 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- 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
- Network flow interdiction on planar graphs
- Detecting critical nodes in sparse graphs
- The critical node detection problem in networks: a survey
- Connectivity interdiction
- Finding the most vital arcs in a network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- The wireless network jamming problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Epidemic dynamics on complex networks
- Network design and defence
- Rational generating functions and integer programming games
- Finding the n Most Vital Links in Flow Networks
- Attack, Defence, and Contagion in Networks
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Shortest-path network interdiction
- Multilevel Approaches for the Critical Node Problem
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Equilibrium points in n -person games
- The stochastic critical node problem over trees
- The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
This page was built for publication: The critical node game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645160)
