Pages that link to "Item:Q2668688"

The following pages link to Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688):

Displaying 11 items.

• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• A preliminary analysis of the distance based critical node problem (Q510911) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
• Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Robust critical node selection by Benders decomposition (Q2806873) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• (Q5379116) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)
• A comparative cost assessment of coalescing epidemic control strategies in heterogeneous social-contact networks (Q6568504) (← links)