Pages that link to "Item:Q3010410"
From MaRDI portal
The following pages link to The Complexity and Approximability of Minimum Contamination Problems (Q3010410):
Displayed 4 items.
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)