Pages that link to "Item:Q1175201"
From MaRDI portal
The following pages link to Divide-and-conquer and parallel graph reduction (Q1175201):
Displaying 7 items.
- A parallel algorithm for finding minimum cutsets in reducible graphs (Q1328109) (← links)
- \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (Q1391774) (← links)
- Parallelization of divide-and-conquer in the Bird-Meertens formalism (Q1906040) (← links)
- Pipelined functional tree accesses and updates: Scheduling, synchronization, caching and coherence (Q2757080) (← links)
- A data-parallel formulation for divide and conquer algorithms (Q2765229) (← links)
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model (Q3801099) (← links)
- Pipelines for Divide-and-Conquer Functions (Q4039036) (← links)