BIT Numerical Mathematics

, Volume 26, Issue 2, pp 195–198 | Cite as

A note on parallel depth first search

  • Y. Zhang
Part I Computer Science

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.

CR categories

F.2.2 G.2.2 H.3.3 

Keywords

Parallel algorithm depth first search graph acyclic digraph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. K. Ghosh and G. P. Bhattacharjee:A parallel search algorithm for directed acyclic graphs, BIT 24 (1984) pp. 130–150.Google Scholar
  2. 2.
    Y. Zhang:Parallel Algorithms for Problems Involving Directed Graphs, Ph.D. Thesis, Drexel University, Philadelphia PA 19104, U.S.A.Google Scholar

Copyright information

© BIT Foundations 1986

Authors and Affiliations

  • Y. Zhang
    • 1
  1. 1.Department of Mathematics and Computer ScienceDrexel UniversityPhiladelphiaUSA

Personalised recommendations