A parallel algorithm for the maximal path problem-Reference-Cited by-同舟云学术

A parallel algorithm for the maximal path problem

Published:1987-12 Issue:4 Volume:7 Page:315-326
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Anderson Richard

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

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

Reference11 articles.

1. R. Anderson andE. Mayr, Parallelism and greedy algorithms,Technical Report No. STAN CS-84-1003, Computer Science Department, Stanford University, April 1984.

2. R. Anderson andE. Mayr, Parallelism and the maximal path problem,Information Processing Letters,24 (1987), 121–126.

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

4. S. Fortune andJ. Willie, Parallelism in random access machines,Proc. 10th ACM STOC (1978), 114–118.

5. H. Gabow,Private communication, 1985.

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

1. The Study of Social Interaction in Educational Settings: Accomplishments and Unresolved Issues¹;Human Development;1998

2. An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs;Journal of Algorithms;1995-03

3. On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs;Journal of Algorithms;1993-11

4. Efficient parallel graph algorithms based on open ear decomposition;Parallel Computing;1993-08

5. Efficient parallel graph algorithms based on open ear decomposition;Lecture Notes in Computer Science;1993