Graph algorithms on a tree-structured parallel computer
type: Item
instance of: scholarly article
title: Graph algorithms on a tree-structured parallel computer
zbMATH Open document ID: 0545.68061
DOI: 10.1007/BF02136031
author: N. E. Zubov
published in: BIT
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3868638
zbMATH Keywords: SIMD computer
zbMATH Keywords: systolic computer
zbMATH Keywords: graph algorithm
zbMATH Keywords: time complexity
zbMATH Keywords: Parallel algorithms
zbMATH Keywords: tree-structured computer
zbMATH Keywords: connected components
zbMATH Keywords: transitive closure
zbMATH Keywords: minimum spanning tree
MaRDI profile type: Publication
cites work: A parallel algorithm for constructing minimum spanning trees
cites work: Efficient parallel algorithms for some graph problems
cites work: Parallel Matrix and Graph Algorithms
cites work: Computing connected components on parallel computers
cites work: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
cites work: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
cites work: Parallel algorithms for the connected components and minimal spanning tree problems
cites work: Q4144192
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
full work available at URL: https://doi.org/10.1007/bf02136031
OpenAlex ID: W2050278180
description: scientific article; zbMATH DE number 3868638