Pages that link to "Item:Q510911"

The following pages link to A preliminary analysis of the distance based critical node problem (Q510911):

Displaying 4 items.

• 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)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)