An 0(log n) parallel algorithm for strong connectivity augmentation problem
Pranay Chaudhuri · International Journal of Computer Mathematics · 1987
A synchronised parallel algorithm for the strong connectivity augmentation problem is presented. Its depth is 0(log n) using 0(n 3) processors on a concurrent read, concurrent write parallel random access machine.