Author:
Ibarra Louis,Richards Dana
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. R. Anderson. A parallel algorithm for the maximal path problem. Combinatorica, 7:315–326, 1987.
2. R. Anderson and E. Mayr. Parallelism and the maximal path problem. Information Processing Letters, 24:121–126, 1987.
3. J. Bondy and U. Murty. Graph Theory with Applications. North-Holland, Amsterdam, 1976.
4. R. Cole and U. Vishkin. Approximate parallel scheduling ii: Applications to logarithmic-time optimal parallel graph algorithms. Information and Computation, 92:1–47, 1991.
5. T. H. Corman, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill Book Co., Cambridge, MA and New York, NY, 1990.