Transitive reduction in parallel via branchings

The authors study the following problem: given a strongly connected digraph, find a minimal strongly connected spanning subgraph of it. Their main result is a parallel algorithm for this problem, which runs in polylog parallel time and uses O(n{sup 3}) processors on a PRAM. The authors' algorithm is simple and the major tool it uses is computing a minimum-weigh branching with zero-one weights. They also present sequential algorithms for the problem that run in time (m + n {center dot} log n).

[1]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[2]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[3]  Mark K. Goldberg,et al.  A new parallel algorithm for the maximal independent set problem , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[5]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[6]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[7]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[8]  Danny Soroker,et al.  Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems , 1988, J. Algorithms.

[9]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[10]  Eli Upfal,et al.  Are search and decision programs computationally equivalent? , 1985, STOC '85.

[11]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[12]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..