Parallelism and the maximal path problem
type: Item
instance of: scholarly article
title: Parallelism and the maximal path problem
zbMATH Open document ID: 0637.68079
DOI: 10.1016/0020-0190(87)90105-0
author: Ernst W. Mayr
author: Richard J. Anderson
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: 05-04
zbMATH DE Number: 4039321
zbMATH Keywords: computational complexity
zbMATH Keywords: parallel algorithm
zbMATH Keywords: P-completeness
zbMATH Keywords: maximal path problem
zbMATH Keywords: planar graphs
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90105-0
OpenAlex ID: W2081298180
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Parallelism in random access machines
cites work: Q4128417
cites work: An optimal parallel connectivity algorithm
description: scientific article; zbMATH DE number 4039321