Pages that link to "Item:Q2997791"

The following pages link to Cardinality-Constrained Critical Node Detection Problem (Q2997791):

Displaying 15 items.

• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• A genetic algorithm for a class of critical node problems (Q325485) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← 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)
• Minimum vertex cover problem for coupled interdependent networks with cascading failures (Q2255970) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
• Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• The connected critical node problem (Q2672625) (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)