Pages that link to "Item:Q1634769"

The following pages link to Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769):

Displaying 12 items.

• A genetic algorithm for a class of critical node problems (Q325485) (← links)
• A preliminary analysis of the distance based critical node problem (Q510911) (← links)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• Interdicting facilities in tree networks (Q2121611) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• The connected critical node problem (Q2672625) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)