Pages that link to "Item:Q1750314"

The following pages link to The critical node detection problem in networks: a survey (Q1750314):

Displaying 48 items.

• Analysis of complex network performance and heuristic node removal strategies (Q312858) (← links)
• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• Detecting critical nodes in sparse graphs (Q1013394) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• Compact models for critical node detection in telecommunication networks (Q1742251) (← links)
• Critical node identification for complex network based on a novel minimum connected dominating set (Q1746796) (← links)
• Analysis of critical damage in the communication network. I: Model and computational experiment (Q1995357) (← links)
• Construction of simple path graphs in transport networks. I: General solutions and examples (Q1995394) (← links)
• Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• On critical node problems with vulnerable vertices (Q2169985) (← links)
• On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
• Analysis of cluster damages in network systems (Q2206489) (← links)
• A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
• Analysis of critical damage in the communication network. III: Analysis of internode flows (Q2239212) (← links)
• Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
• Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
• An approach to the analysis of possible structural damages in multicommodity network systems (Q2284269) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• Considering the isolation set problem (Q2509521) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• The connected critical node problem (Q2672625) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• (Q5379116) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• The firebreak problem (Q6065343) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Assistance and interdiction problems on interval graphs (Q6094722) (← links)
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)
• Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements (Q6196884) (← links)
• Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)
• On critical node problems with vulnerable vertices (Q6616219) (← links)
• Farthest-first traversal for identifying multiple influential spreaders (Q6621482) (← links)
• The critical node game (Q6645160) (← links)
• A survey on optimization studies of group centrality metrics (Q6659090) (← links)