A note on parallel depth first search
- 39 Downloads
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.
CR categoriesF.2.2 G.2.2 H.3.3
KeywordsParallel algorithm depth first search graph acyclic digraph
Unable to display preview. Download preview PDF.