Solving the Distance-Based Critical Node Problem
From MaRDI portal
(Redirected from Publication:5087707)
Recommendations
- A preliminary analysis of the distance based critical node problem
- The connected critical node problem
- Efficient methods for the distance-based critical node detection problem in complex networks
- An optimal approach for the critical node problem using semidefinite programming
- scientific article; zbMATH DE number 7059791
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Component-cardinality-constrained critical node problem in graphs
- The bi-objective critical node detection problem
Cites work
- A faster algorithm for betweenness centrality*
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
- An integer programming approach for fault-tolerant connected dominating sets
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of the critical node problem over trees
- Detecting critical node structures on graphs: a mathematical programming approach
- Detecting critical nodes in sparse graphs
- Efficient methods for the distance-based critical node detection problem in complex networks
- Epidemic dynamics on complex networks
- Exact identification of critical nodes in sparse networks via new compact formulations
- Extended formulations in combinatorial optimization
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Hybrid constructive heuristics for the critical node problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Identifying sets of key players in a social network
- Imposing Connectivity Constraints in Forest Planning Models
- Length-bounded cuts and flows
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- On the monotonization of polyhedra
- Parsimonious formulations for low-diameter clusters
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Selected topics in critical element detection
- The critical node detection problem in networks: a survey
- The optimal design of low-latency virtual backbones
- The University of Florida sparse matrix collection
- The wireless network jamming problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
Cited in
(7)- The connected critical node problem
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- A polytime preprocess algorithm for the maximum independent set problem
- A fast tri-individual memetic search approach for the distance-based critical node problem
- Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search
- A folding preprocess for the max k-cut problem
- Optimal design of vaccination policies: a case study for Newfoundland and Labrador
This page was built for publication: Solving the Distance-Based Critical Node Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087707)
