Pages that link to "Item:Q1013394"

The following pages link to Detecting critical nodes in sparse graphs (Q1013394):

Displaying 27 items.

• 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)
• A Region Growing Algorithm for Detecting Critical Nodes (Q2942434) (← links)
• A Fast Greedy Algorithm for the Critical Node Detection Problem (Q2942435) (← links)
• Computing Critical Nodes in Directed Graphs (Q4555541) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
• A first hitting time approach to finding effective spreaders in a network (Q4965258) (← links)
• The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← 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)
• Selected Topics in Critical Element Detection (Q5260999) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes (Q6066057) (← links)
• Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks (Q6066064) (← 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)
• Research communities in cyber security vulnerability assessments: a comprehensive literature review (Q6101354) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)