A parallel search algorithm for directed acyclic graphs
type: Item
instance of: scholarly article
title: A parallel search algorithm for directed acyclic graphs
zbMATH Open document ID: 0542.68049
DOI: 10.1007/BF01937481
author: Ratan K. Ghosh
author: G. P. Bhattacharjee
published in: BIT
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 3862454
zbMATH Keywords: antilexicographic
zbMATH Keywords: spanning tree
zbMATH Keywords: parallel algorithm
zbMATH Keywords: depth-first searching
zbMATH Keywords: directed acyclic graph
zbMATH Keywords: shared memory model
zbMATH Keywords: SIMD
zbMATH Keywords: traversal algorithms
MaRDI profile type: Publication
cites work: Q4091421
cites work: The ILLIAC IV Computer
cites work: Q4195963
cites work: Merging with parallel processors
cites work: Q4195901
cites work: Parallel Algorithms in Graph Theory: Planarity Testing
cites work: Parallel Solution of Recurrence Problems
cites work: On the Parallel Evaluation of Polynomials
cites work: New Parallel-Sorting Schemes
cites work: Parallel Computations in Graph Theory
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
cites work: Gaussian elimination is not optimal
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Finding Dominators in Directed Graphs
full work available at URL: https://doi.org/10.1007/bf01937481
OpenAlex ID: W1978615272
description: scientific article; zbMATH DE number 3862454