Parallel search algorithms for graphs and trees
- 1 January 1993
- journal article
- Published by Elsevier in Information Sciences
- Vol. 67 (1-2) , 137-165
- https://doi.org/10.1016/0020-0255(93)90088-4
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Parallel Depth-First Search in General Directed GraphsSIAM Journal on Computing, 1990
- Finding and Updating Depth-First Spanning Trees of Acyclic Digraphs in ParallelThe Computer Journal, 1990
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- Parallel algorithms for connectivity problems in graph theoryInternational Journal of Computer Mathematics, 1986
- A parallel search algorithm for directed acyclic graphsBIT Numerical Mathematics, 1984
- Parallel strong orientation of an undirected graphInformation Processing Letters, 1984
- Parallel breadth-first search algorithms for trees and graphsInternational Journal of Computer Mathematics, 1984
- Algorithm 97: Shortest pathCommunications of the ACM, 1962