A parallel algorithm for the maximal path problem

Abstract

In this paper we present anO (log5 n) time parallel algorithm for constructing a Maximal Path in an undirected graph. We also give anO (log1/2+ε) time parallel algorithm for constructing a depth first search tree in an undirected graph.

This is a preview of subscription content, access via your institution.

References

  1. [1]

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

  2. [2]

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

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

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

    MATH  Article  MathSciNet  Google Scholar 

  4. [4]

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

  5. [5]

    H. Gabow,Private communication, 1985.

  6. [6]

    R. M. Karp, E. Upfal andA. Wigderson, Constructing a maximum matching is in random NC,Combinatorica,6 (1986), 35–48.

    MATH  MathSciNet  Google Scholar 

  7. [7]

    R. M. Karp andA. Wigderson, A fast parallel algorithm for the maximal independent set problem,JACM,32 (4) (1985), 762–773.

    MATH  Article  MathSciNet  Google Scholar 

  8. [8]

    K. Mulmuley, U. Vazarani andV. Vazarani, Matching is as easy as matrix inversion,Combinatorica,7 (1987), 105–113.

    MATH  Article  MathSciNet  Google Scholar 

  9. [9]

    J. Reif. Depth first search is inherently sequential,Information Processing Letters,20 (1985), 229–234.

    MATH  Article  MathSciNet  Google Scholar 

  10. [10]

    R. E. Tarján andU. Vishkin, Finding biconnected components and computing tree function in logarithmic parallel time,Proc. 25th FOCS, (1984) 12–20.

  11. [11]

    U. Vishkin, An optimal parallel connectivity algorithm,RC 9149, IBM T.J. Watson Research Center, Yorktown Heights, N. Y., 1981.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

This work was supported in part by an IBM Faculty Development Award, an NSF Graduate Fellowship, and NSF grant DCR-8351757.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Anderson, R. A parallel algorithm for the maximal path problem. Combinatorica 7, 315–326 (1987). https://doi.org/10.1007/BF02579320

Download citation

AMS subject classification (1980)

  • 68 Q 10
  • 05 C 38