An optimal parallel connectivity algorithm
type: Item
instance of: scholarly article
title: An optimal parallel connectivity algorithm
zbMATH Open document ID: 0546.68044
DOI: 10.1016/0166-218X(84)90019-2
author: Uzi Vishkin
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3870608
zbMATH Keywords: synchronized parallel algorithm
zbMATH Keywords: connected components of an undirected graph
zbMATH Keywords: speed-up
MaRDI profile type: Publication
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: A unified approach to models of synchronous parallel machines
cites work: Computing connected components on parallel computers
cites work: Q4146249
cites work: Ultracomputers
cites work: Finding the maximum, merging, and sorting in a parallel computation model
cites work: An O(logn) parallel connectivity algorithm
cites work: An O(n2log n) parallel max-flow algorithm
cites work: Simulation of Parallel Random Access Machines by Circuits
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Implementation of simultaneous memory address access in models that forbid it
description: scientific article; zbMATH DE number 3870608