Showing papers on "Breadth-first search published in 1986"
TL;DR: This paper presents an unbounded-parallel algorithm for performing a depth-first search of a planar undirected graph that uses n processors and executes in O(\log ^3 n)-time.
Abstract: This paper presents an unbounded-parallel algorithm for performing a depth-first search of a planar undirected graph. The algorithm uses $O(n^4 )$ processors and executes in $O(\log ^3 n)$-time. It had previously been conjectured that the problem of computing a depth-first spanning tree was inherently sequential.
55 citations
30 citations
TL;DR: The subject of this note is the parallel algorithm for depth first searching of a directed acyclic graph by Ghosh and Bhattacharjee and it is pointed out that their algorithm does not always work.
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.
2 citations
TL;DR: In this paper an algorithm, named BREADTH, also computing breadth first spanning trees, is proposed, the complexity of which is O(log2 n) using O{n 3/logn) processors, and an efficient parallel algorithm,named BreadTHFOREST, is presented, which generalizes algorithm B BreadTH.
Abstract: Ghosh and Bhattacharjee propose [2] (Intern. J. Computer Math., 1984, Vol. 15, pp. 255-268) an algorithm of determining breadth first spanning trees for graphs, which requires that the input graphs contain some vertices, from which every other vertex in the input graph can be reached. These vertices are called starting vertices. The complexity of the GB algorithm is O(log2 n) using O{n 3) processors. In this paper an algorithm, named BREADTH, also computing breadth first spanning trees, is proposed. The complexity is O(log2 n) using O{n 3/logn) processors. Then an efficient parallel algorithm, named- BREADTHFOREST, is proposed, which generalizes algorithm BREADTH. The output of applying BREADTHFOREST to a general graph, which may not contain any starting vertices, is a breadth first spanning forest of the input graph. The complexity of BREADTHFOREST is the same as BREADTH.