Abstract
The subject of this note is the parallel algorithm for depth first searching of a directed acyclic graph by Ghosh and Bhattacharjee. It is pointed out that their algorithm does not always work. A counter example is given. This paper also states the necessary and sufficient condition for the algorithm to fail, or to work correctly.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. K. Ghosh and G. P. Bhattacharjee:A parallel search algorithm for directed acyclic graphs, BIT 24 (1984) pp. 130–150.
Y. Zhang:Parallel Algorithms for Problems Involving Directed Graphs, Ph.D. Thesis, Drexel University, Philadelphia PA 19104, U.S.A.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, Y. A note on parallel depth first search. BIT 26, 195–198 (1986). https://doi.org/10.1007/BF01933745
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933745