Skip Navigation

The Computer Journal 1990 33(3):247-251; doi:10.1093/comjnl/33.3.247
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chaudhuri, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Finding and Updating Depth-First Spanning Trees of Acyclic Digraphs in Parallel

P. Chaudhuri *

Department of Computer Science, James Cook University of North Queensland, Townsville, Qld. 4811, Australia

Fast parallel algorithms are presented for finding and updating the depth-first spanning tree of an acyclic digraph. The machine model used is a parallel random access machine that allows simultaneous access to the same memory location during only the read operation. The parallel depth-first search algorithm is based on a partial spanning tree doubling technique which is found to be useful in updating the depth-first spanning tree when a new node (edge) is added to an acyclic digraph. The most notable result is an O(log n) time parallel algorithm for updating the depth-first spanning tree solution when a new node (edge) is added to an n node acyclic digraph whose depth-first spanning tree is known.

Received March 1989.

* Department of Computer Science, James Cook University of North Queensland, Townsville, Qld. 4811, Australia

§ Now at: Department of Computer Science, School of Electrical Engineering and Computer Science, The University of South Wales, NSW 2033, Australia.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.