Pages that link to "Item:Q299073"
From MaRDI portal
The following pages link to Component-cardinality-constrained critical node problem in graphs (Q299073):
Displaying 11 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)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
- The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
- The connected critical node problem (Q2672625) (← links)
- The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
- Critical node/edge detection problems on trees (Q6054014) (← links)
- The stochastic critical node problem over trees (Q6092626) (← links)