Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
type: Item
instance of: scholarly article
title: Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
zbMATH Open document ID: 0724.68012
DOI: 10.1016/0890-5401(91)90019-X
author: Uzi Vishkin
author: Richard Cole
published in: Information and Computation
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4195148
zbMATH Keywords: approximate parallel scheduling
zbMATH Keywords: list ranking
zbMATH Keywords: logarithmic time parallel
zbMATH Keywords: PRAM
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Q4091421
cites work: Parallel strong orientation of an undirected graph
cites work: New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
cites work: Finding Euler tours in parallel
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: An optimally efficient selection algorithm
cites work: Efficient parallel algorithms for some graph problems
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Faster optimal parallel prefix sums and list ranking
cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Q3883524
cites work: Q3795245
cites work: Optimal Parallel 5-Colouring of Planar Graphs
cites work: Computing connected components on parallel computers
cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
cites work: An O(logn) parallel connectivity algorithm
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: An optimal parallel connectivity algorithm
cites work: On efficient parallel strong orientation
full work available at URL: 0890-5401(91)90019-x
OpenAlex ID: W2039757598
description: scientific article; zbMATH DE number 4195148