Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 22, 1987 - Issue 3-4
Submit an article Journal homepage
38
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

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

Pranay Chaudhuri Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, 721302, India
Pages 187-197 | Received 01 Dec 1985, Published online: 20 Mar 2007
 
Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Abstract

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.

C.R. Categories:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.