Divide-and-conquer and parallel graph reduction

DOI10.1016/S0167-8191(05)80105-XzbMATH Open0744.68062OpenAlexW2009719007MaRDI QIDQ1175201FDOQ1175201

Authors: Fethi A. Rabhi, G. Manson 

Publication date: 25 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80105-x

Recommendations

• Distributed computation by graph reduction
• scientific article; zbMATH DE number 3963189
• scientific article; zbMATH DE number 124283
• \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms
• scientific article; zbMATH DE number 4082955

zbMATH Keywords

divide-and-conquerpartitioningfunctional programsparallel graph reduction

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)

Cited In (7)

• A data-parallel formulation for divide and conquer algorithms
• Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
• Pipelined functional tree accesses and updates: Scheduling, synchronization, caching and coherence
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• A parallel algorithm for finding minimum cutsets in reducible graphs
• Pipelines for Divide-and-Conquer Functions
• Title not available (Why is that?)

This page was built for publication: Divide-and-conquer and parallel graph reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175201)