Pages that link to "Item:Q1013394"

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

Displaying 36 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• Minimum edge blocker dominating set problem (Q319914) (← links)
• A genetic algorithm for a class of critical node problems (Q325485) (← links)
• Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
• Information theory perspective on network robustness (Q341919) (← links)
• Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
• Social structure optimization in team formation (Q342472) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• The topological defense in SIS epidemic models (Q508188) (← links)
• A preliminary analysis of the distance based critical node problem (Q510911) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• Complexity of the critical node problem over trees (Q547128) (← links)
• A multi-criteria optimization model for humanitarian aid distribution (Q652675) (← links)
• A mathematical programming computational model for disproportionate collapse analysis of steel building frames (Q691388) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← 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)
• 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)
• Finding Critical Links for Closeness Centrality (Q5138269) (← 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)