Abstract
Abstract Fast parallel updating algorithms are proposed for the following problems: minimum-depth search for general graphs; depth-first search and breadth-depth search for directed acyclic graphs. The computational model used is a shared memory single-instruction stream, multiple-data stream computer that allows only the read conflict. The start-over algorithms for all these spanning tree problems are based on the “growing-by-doubling” paradigm and hence have a similar structure. It is shown that the same technique is equally effective in designing algorithms for certain updating problems with reference to the graph searching. The time complexity of all these updating algorithms are shown to be less than the corresponding start-over algorithms by a factor of log n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
