An integer programming framework for critical elements detection in graphs
From MaRDI portal
Publication:405684
DOI10.1007/S10878-014-9730-4zbMATH Open1303.90120OpenAlexW1987468019MaRDI QIDQ405684FDOQ405684
Eduardo L. Pasiliao, Alexander Veremyev, Oleg A. Prokopyev
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9730-4
Recommendations
- Detecting critical node structures on graphs: a mathematical programming approach
- Detecting critical nodes in sparse graphs
- Selected topics in critical element detection
- A fast greedy algorithm for the critical node detection problem
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Cites Work
- The university of Florida sparse matrix collection
- Statistical mechanics of complex networks
- Title not available (Why is that?)
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Identifying sets of key players in a social network
- Connected components in random graphs with given expected degree sequences
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Detecting critical nodes in sparse graphs
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Exact identification of critical nodes in sparse networks via new compact formulations
- A derandomized approximation algorithm for the critical node detection problem
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Selected Topics in Critical Element Detection
- Node-and edge-deletion NP-complete problems
- Intermediate integer programming representations using value disjunctions
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Cardinality-Constrained Critical Node Detection Problem
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- The valve location problem in simple network topologies
- How to Cut a Graph into Many Pieces
- Title not available (Why is that?)
- Disconnecting graphs by removing vertices: a polyhedral approach
Cited In (37)
- Minimum cost edge blocker clique problem
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Efficient methods for the distance-based critical node detection problem in complex networks
- Hybrid constructive heuristics for the critical node problem
- Fortification Against Cascade Propagation Under Uncertainty
- A Fast Greedy Algorithm for the Critical Node Detection Problem
- Optimal detection of critical nodes: improvements to model structure and performance
- A compact mixed integer linear formulation for safe set problems
- Finding Critical Links for Closeness Centrality
- Critical node detection problem for complex network in undirected weighted networks
- Complexity of the multilevel critical node problem
- The stochastic critical node problem over trees
- A fast tri-individual memetic search approach for the distance-based critical node problem
- Graph signatures: identification and optimization
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- Methods for removing links in a network to minimize the spread of infections
- Exact algorithms for the minimum cost vertex blocker clique problem
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Critical node/edge detection problems on trees
- Minimum edge blocker dominating set problem
- Improved formulations for minimum connectivity network interdiction problems
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
- A Region Growing Algorithm for Detecting Critical Nodes
- Detecting critical node structures on graphs: A mathematical programming approach
- Integer programming methods for solving binary interdiction games
- The connected critical node problem
- The critical node game
- Wildfire fuel management: network-based models and optimization of prescribed burning
- Sequential Shortest Path Interdiction with Incomplete Information
- On designing networks resilient to clique blockers
- The bi-objective critical node detection problem
- The critical node detection problem in networks: a survey
- Two-stage nodal network interdiction under decision-dependent uncertainty
Uses Software
This page was built for publication: An integer programming framework for critical elements detection in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405684)
