The following pages link to (Q2921652):
Displaying 10 items.
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- A network game with attackers and a defender (Q930603) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Finding the probability of infection in an SIR network is NP-hard (Q1926503) (← links)
- Competitive and collaborative influence in social networks (Q2422617) (← links)
- A Region Growing Algorithm for Detecting Critical Nodes (Q2942434) (← links)
- A Fast Greedy Algorithm for the Critical Node Detection Problem (Q2942435) (← links)
- The Complexity and Approximability of Minimum Contamination Problems (Q3010410) (← links)
