A parallel algorithm for the maximal path problem

This publication has 8 references indexed in Scilit:

• Matching is as easy as matrix inversion
  Combinatorica, 1987
• Parallelism and the maximal path problem
  Information Processing Letters, 1987
• Constructing a perfect matching is in random NC
  Combinatorica, 1986
• A fast parallel algorithm for the maximal independent set problem
  Journal of the ACM, 1985
• Depth-first search is inherently sequential
  Information Processing Letters, 1985
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Finding biconnected componemts and computing tree functions in logarithmic parallel time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1984
• Parallelism in random access machines
  Published by Association for Computing Machinery (ACM) ,1978