Pages that link to "Item:Q2817641"
From MaRDI portal
The following pages link to Derandomization through approximation, an NC algorithm for minimum cuts (Q2817641):
Displaying 6 items.
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Approximating unweighted connectivity problems in parallel (Q1854474) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- An $\NC$ Algorithm for Minimum Cuts (Q4337444) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- Low-diameter graph decomposition is in NC (Q5056131) (← links)