A random 1-011-011-01algorithm for depth first search-Reference-Cited by-同舟云学术

A random 1-011-011-01algorithm for depth first search

Published:1988-03 Issue:1 Volume:8 Page:1-12
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Aggarwal A.,Anderson R. J.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

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

Reference17 articles.

1. R. J. Anderson, A parallel algorithm for the maximal path problem,Combinatorica,7 (1987), 315–326.

2. R. J.Anderson, A parallel algorithm for depth-first search,Extended Abstract, Math. Science Research Institute (1986).

3. R. J.Anderson and E.Mayr, Parallelism and greedy algorithms,Technical Report No. STAN-CS-84-1003,Computer Science Department, Stanford University (1984).

4. S. A. Cook, A taxonomy of problems with fast parallel algorithms,Information and Control,64 (1985), 2–22.

5. D.Eckstein and D.Alton, Parallel graph processing using depth first search,Proc. of the Conf. on Theoretical Computer Science at the Univ. of Waterloo, (1977), 21–29.

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

1. Efficient parallel graph trimming by arc-consistency;The Journal of Supercomputing;2022-04-16

2. Frameworks for designing in-place graph algorithms;Journal of Computer and System Sciences;2022-02

3. The Recognition Problem of Graph Search Trees;SIAM Journal on Discrete Mathematics;2021-01

4. Streaming Complexity of Spanning Tree Computation;LEIBNIZ INT PR INFOR;2020

5. Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs;ACM Transactions on Parallel Computing;2019-12-05