A synchronised parallel algorithm for the strong connectivity augmentation problem is presented. Its depth is 0(logn) using 0(n3) processors on a concurrent read, concurrent write parallel random access machine.
A synchronised parallel algorithm for the strong connectivity augmentation problem is presented. Its depth is 0(logn) using 0(n3) processors on a concurrent read, concurrent write parallel random access machine.
暂无评论