Determining connected components in linear time by a linear number of processors
type: Item
instance of: scholarly article
title: Determining connected components in linear time by a linear number of processors
zbMATH Open document ID: 0653.68066
DOI: 10.1016/0020-0190(87)90219-5
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4066360
zbMATH Keywords: parallel algorithm
zbMATH Keywords: transitive closure
zbMATH Keywords: connected components
zbMATH Keywords: simple undirected graph
zbMATH Keywords: SIMD
author: Ferdinand Peper
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90219-5
OpenAlex ID: W2041451693
cites work: Efficient parallel algorithms for some graph problems
cites work: Parallel Matrix and Graph Algorithms
cites work: Q4146249
cites work: Computing connected components on parallel computers
cites work: An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
cites work: Cellular arrays for the solution of graph problems
cites work: Parallel algorithms for the connected components and minimal spanning tree problems
cites work: Q4080720
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
cites work: The Parallel Recognition of Classes of Graphs
description: scientific article; zbMATH DE number 4066360