Fast parallel graph searching with applications-Reference-Cited by-同舟云学术

Fast parallel graph searching with applications

Published:1988-03 Issue:1 Volume:28 Page:1-18
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Chaudhuri Pranay

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01934690.pdf

Reference18 articles.

1. 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.

2. R. P. Brent,The parallel evaluation of general arithmetic expressions, J.ACM, 21; (1974), pp. 201–206.

3. P. Chaudhuri,Algorithms for finding centers and medians of trees and graphs on a parallel computation model, J. Indian Inst. Sci., to appear.

4. P. Chaudhuri,Fast parallel algorithms for a class of graph problems, J. Comb. Inf. Syst. Sci., to appear.

5. P. Chaudhuri,An O(logn)parallel algorithm for strong connectivity augmentation problem, Intern. J. Comp., Math., 22 (1987), pp. 187–197.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Self-stabilizing tree ranking;International Journal of Computer Mathematics;2005-05

2. Parallel updating algorithms for graph searching problems;Journal of Systems Architecture;1996-11

3. Algorithms for finding and updating minimum-depth spanning trees in parallel;Information Sciences;1995-11

4. Finding maximum matching for bipartite graphs in parallel;Operations Research Letters;1994-08

5. A bibliography of heuristic search research through 1992;IEEE Transactions on Systems, Man, and Cybernetics;1994