Opening book details…
Can I read Parallel Depth-first Search in General Directed Graphs on EtoBox?
Parallel Depth-first Search in General Directed Graphs by A. Aggarwal; R. J. Anderson; M.-Y. Kao is a scholarly article available to read on EtoBox.
What is Parallel Depth-first Search in General Directed Graphs about?
A directed cycle separator of an n-vertex directed graph is a simple directed cycle such that when the vertices of the cycle are deleted, the resulting gra.ph has no strongly connected component, with more than n/2 vertices. This paper shows that the problem of finding a directed cycle separator is in ra.ndomized NC. The paper also proves tha.1. computing cycle separators and conducting depth-first sea.rch in directed graphs are deterministic NC-equivalent. These two results together yield the first RNC algorithm for depthfirst search in directed graphs.
- Author
- A. Aggarwal; R. J. Anderson; M.-Y. Kao
- Publisher
- ACM Press
- Published
- 1989
- Language
- EN