An 0(log n) parallel algorithm for strong connectivity augmentation problem

References

• Eckstein , D. M. and Alton , D. A. 1977 . Proceedings of the Conference on Theoretical Computer Science, Ont . Parallel graph processing using depth-first search . 1977 , Canada.
   Google Scholar
• Eswaran , K. P. and Tarjan , R. E. 1976 . Augmentation problems . SIAM J. Computing , 5 : 653 – 665 .
   Google Scholar
• Kučera , L. 1982 . Parallel computation and conflicts in memory access . Information Processing Letters , 14 : 93 – 96 .
   Web of Science ®Google Scholar
• Reghbati , E. and Corneil , D. G. 1978 . Parallel computations in graph theory . SIAM J. Computing , 7 : 230 – 237 .
   Web of Science ®Google Scholar
• Reif , J. H. 1985 . Depth-first search is inherently sequential . Information Processing letters , 20 : 229 – 234 .
   Google Scholar
• Reif J. H. Spirakis P. The Expected Time Complexity of Parallel Graph and Digraph Algorithms Tech. Rep. TR-11-82 Aiken Computation Laboratory, Harvard Univ. Cambridge, Mass 1982
   Google Scholar
• Shiloach , Y. and Vishkin , U. 1981 . Finding the maximum merging, and sorting in a parallel computation model . J. Algorithms , 2 : 88 – 102 .
   Web of Science ®Google Scholar
• Tarjan , R. E. 1972 . Depth-first search and linear graph algorithms . SIAM J. Computing , 1 : 146 – 166 .
   Google Scholar