Detecting critical nodes in sparse graphs
From MaRDI portal
Publication:1013394
DOI10.1016/j.cor.2008.08.016zbMath1158.90411OpenAlexW2121035174MaRDI QIDQ1013394
Lily Elefteriadou, Ashwin Arulselvan, Clayton W. Commander, Panos M. Pardalos
Publication date: 17 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.016
Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (77)
Complexity of the multilevel critical node problem ⋮ Hybrid constructive heuristics for the critical node problem ⋮ An optimal approach for the critical node problem using semidefinite programming ⋮ Minimum cost edge blocker clique problem ⋮ Component-cardinality-constrained critical node problem in graphs ⋮ 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 ⋮ VNS solutions for the critical node problem ⋮ Minimum edge blocker dominating set problem ⋮ A genetic algorithm for a class of critical node problems ⋮ Computing Critical Nodes in Directed Graphs ⋮ Network interdiction via a critical disruption path: branch-and-price algorithms ⋮ A derandomized approximation algorithm for the critical node detection problem ⋮ A randomized algorithm with local search for containment of pandemic disease spread ⋮ A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ Improved formulations for minimum connectivity network interdiction problems ⋮ Information theory perspective on network robustness ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ Social structure optimization in team formation ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ On critical node problems with vulnerable vertices ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Solving the Distance-Based Critical Node Problem ⋮ A Region Growing Algorithm for Detecting Critical Nodes ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ Exact interdiction models and algorithms for disconnecting networks via node deletions ⋮ The bi-objective critical node detection problem ⋮ Integer programming methods for solving binary interdiction games ⋮ The connected critical node problem ⋮ Critical node/edge detection problems on trees ⋮ Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes ⋮ Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Bound and exact methods for assessing link vulnerability in complex networks ⋮ An integer programming framework for critical elements detection in graphs ⋮ The stochastic critical node problem over trees ⋮ Research communities in cyber security vulnerability assessments: a comprehensive literature review ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ On designing networks resilient to clique blockers ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results ⋮ Influential node detection of social networks based on network invulnerability ⋮ Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth ⋮ A multi-criteria optimization model for humanitarian aid distribution ⋮ Exact identification of critical nodes in sparse networks via new compact formulations ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ A compact mixed integer linear formulation for safe set problems ⋮ Wireless LAN transmitter location under the threat of jamming attacks ⋮ Efficient heuristic algorithm for identifying critical nodes in planar networks ⋮ Compact models for critical node detection in telecommunication networks ⋮ A two-stage stochastic programming approach for influence maximization in social networks ⋮ The topological defense in SIS epidemic models ⋮ A preliminary analysis of the distance based critical node problem ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ The critical node detection problem in networks: a survey ⋮ Parameterized complexity of critical node cuts ⋮ Literature review: the vaccine supply chain ⋮ An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections ⋮ A mathematical programming computational model for disproportionate collapse analysis of steel building frames ⋮ Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ Complexity of the critical node problem over trees ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ A first hitting time approach to finding effective spreaders in a network ⋮ Optimal \(K\)-node disruption on a node-capacitated network ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs ⋮ The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees ⋮ Selected Topics in Critical Element Detection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Introduction to global optimization
- The wireless network jamming problem
- Epidemic dynamics on complex networks
- A combinatorial algorithm for message scheduling on controller area networks
- Emergence of Scaling in Random Networks
- INTEGER FORMULATIONS FOR THE MESSAGE SCHEDULING PROBLEM ON CONTROLLER AREA NETWORKS
- Multi-Terminal Network Flows
- Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach
This page was built for publication: Detecting critical nodes in sparse graphs
