Pages that link to "Item:Q3525779"
From MaRDI portal
The following pages link to Cut Problems in Graphs with a Budget Constraint (Q3525779):
Displaying 6 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)
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions (Q1987237) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- (Q5075823) (← links)
- Approximability of the <i>k</i>‐server disconnection problem (Q5434594) (← links)
