Pages that link to "Item:Q2329655"
From MaRDI portal
The following pages link to A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655):
Displaying 5 items.
- EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Modeling the spread of infectious diseases through influence maximization (Q2136893) (← links)
- The connected critical node problem (Q2672625) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
