Abstract
This paper presents fast parallel algorithms for the following graph theoretic problems: breadth-depth search of directed acyclic graphs; minimum-depth search of graphs; finding the minimum-weighted paths between all node-pairs of a weighted graph and the critical activities of an activity-on-edge network. The first algorithm hasO(logdlogn) time complexity withO(n 3) processors and the remaining algorithms achieveO(logd loglogn) time bound withO(n 2[n/loglogn]) processors, whered is the diameter of the graph or the directed acyclic graph (which also represents an activity-on-edge network) withn nodes. These algorithms work on an unbounded shared memory model of the single instruction stream, multiple data stream computer that allows both read and write conflicts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. A. Alton and D. M. Eckstein,Parallel breadth-first search of p-sparse graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory, and Comput., California, (1979), pp. 79–93.
R. P. Brent,The parallel evaluation of general arithmetic expressions, J.ACM, 21; (1974), pp. 201–206.
P. Chaudhuri,Algorithms for finding centers and medians of trees and graphs on a parallel computation model, J. Indian Inst. Sci., to appear.
P. Chaudhuri,Fast parallel algorithms for a class of graph problems, J. Comb. Inf. Syst. Sci., to appear.
P. Chaudhuri,An O(logn)parallel algorithm for strong connectivity augmentation problem, Intern. J. Comp., Math., 22 (1987), pp. 187–197.
P. Chaudhuri,Algorithms for some graph problems on a distributed computational model, Information Sciences, to appear.
P. Chaudhuri and R. K. Ghosh,Parallel algorithms for analyzing activity networks, BIT, 26; (1986), pp. 418–429.
N. Christofides,Graph Theory: An Algorithmic Approach, Academic Press, London, (1975).
E. Dekel, D. Nassimi and S. Sahni,Parallel matrix and graph algorithms, SIAM J, Comput., 10; (1981), pp. 657–675.
N. Deo,Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Inc., Englewood Cliffs, N.J., (1974).
D. M. Eckstein and D. A. Alton,Parallel graph processing using depth-first search, Proc. Conf. Theoretical Computer Sci., Waterloo, Ontario, (1977).
R. K. Ghosh and G. P. Bhattacharjee,Parallel breadth-first search algorithms for trees and graphs, Intern. J. Comp. Math., 15; (1984), pp. 255–268.
T. Kim and K. Chwa,Parallel algorithms for a depth first search and a breadth first search, Intern. J. Comp., Math., 19; (1986), pp. 39–54.
L. Kucera,Parallel computation and conflicts in memory access, Inform. Process. Lett., 14; (1982), pp. 93–96.
E. Reghbati and D. G. Corneil,Parallel computations in graph theory, SIAM J. Comput., 7; (1978), pp. 230–237.
J. H. Reif,Depth-first search is inherently sequential, Inform. Process. Lett., 20; (1985), pp. 229–234.
C. D. Savage and J. Ja'Ja',Fast, efficient parallel algorithms for some graph problems, SIAM J. Comput., 10; (1981), pp. 682–691.
Y. Shiloach and U. Vishkin,Finding the maximum, merging, and sorting in a parallel computation model, J. Algorithms, 2; (1981), pp. 88–102.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chaudhuri, P. Fast parallel graph searching with applications. BIT 28, 1–18 (1988). https://doi.org/10.1007/BF01934690
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01934690