Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!emory!hubcap!jzubairi
From: jzubairi@rodan.acs.syr.edu (Junaid Ahmed Zubairi)
Newsgroups: comp.parallel
Subject: Parallel depth first search algorithm
Message-ID: <12400@hubcap.clemson.edu>
Date: 27 Dec 90 14:33:13 GMT
Sender: fpst@hubcap.clemson.edu
Organization: Syracuse University, Syracuse, NY
Lines: 14
Approved: parallel@hubcap.clemson.edu

Has anyone worked on implementing parallel search 
algorithms on SIMD environment. I am specially
interested in knowing about the scheme of depth first
search.
What I have is a scheme in which all nodes in a graph
trace their links recursively to do the search. The
search is carried out in steps during which all nodes 
using visit and link flags to one particular node go
depth-first into the embedded tree. But this scheme
does not look too efficient.

Thanks

Junaid ZUbairi