Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'

DOI10.1109/31.55074zbMATH Open0709.68040OpenAlexW4230580336MaRDI QIDQ3493247

Sajal K. Das, Narsingh Deo

Publication date: 1990

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.55074

zbMATH Keywords

fundamental cycleparallel algorithmsdata structuresbridgesbipartitenessEREW PRAMspanning forestconnected-components

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Title not available (Why is that?) 👍 👎
• Optimal parallel algorithms for path problems on planar graphs 👍 👎
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem 👍 👎
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model 👍 👎
• Efficiently parallelizable problems on a class of decomposable graphs 👍 👎
• Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM 👍 👎
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems 👍 👎
• Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model 👍 👎
• PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL 👍 👎
• Computational Science - ICCS 2004 👍 👎

This page was built for publication: Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'

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