A note on parallel depth first search |
| |
| Authors: | Y Zhang |
| |
| Institution: | (1) Department of Mathematics and Computer Science, Drexel University, 19104 Philadelphia, PA, USA |
| |
| 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. |
| |
| Keywords: | F 2 2 G 2 2 H 3 3 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
