Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
type: Item
instance of: scholarly article
title: Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
zbMATH Open document ID: 0709.68040
DOI: 10.1109/31.55074
author: Sajal K. Das
author: Narsingh Deo
published in: IEEE Transactions on Circuits and Systems
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 4166878
zbMATH Keywords: parallel algorithms
zbMATH Keywords: EREW PRAM
zbMATH Keywords: spanning forest
zbMATH Keywords: fundamental cycle
zbMATH Keywords: bridges
zbMATH Keywords: bipartiteness
zbMATH Keywords: data structures
zbMATH Keywords: connected-components
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1109/31.55074
OpenAlex ID: W4230580336
Recommended article: Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
Recommended article: PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL
Recommended article: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
Recommended article: Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
Recommended article: Efficiently parallelizable problems on a class of decomposable graphs
Recommended article: Q3815886
Recommended article: An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
Recommended article: Computational Science - ICCS 2004
Recommended article: Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
Recommended article: Optimal parallel algorithms for path problems on planar graphs
description: scientific article; zbMATH DE number 4166878