Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model

DOI10.1109/31.1744zbMath0654.68091OpenAlexW2155375914MaRDI QIDQ3801099

Narsingh Deo, Sajal K. Das

Publication date: 1988

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

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

zbMATH Keywords

connected componentsfundamental cycleparallel algorithmsdata structuresbridgesbipartitenessEREW PRAMspanning forest

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A unified approach to parallel depth-first traversals of general trees ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems

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