Skip to main content
SpringerLink
Log in

Efficient parallel algorithms for path problems in directed graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we describe a technique for finding efficient parallel algorithms for problems on directed graphs that involve checking the existence of certain kinds of paths in the graph. This technique provides efficient algorithms for finding dominators in flow graphs, performing interval and loop analysis on reducible flow graphs, and finding the feedback vertices of a digraph. Each of these algorithms takesO(log2 n) time using the same number of processors needed for fast matrix multiplication. All of these bounds are for an EREW PRAM.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Aggarwal, R. Anderson, and M. Kao, Parallel Depth-First Search in General Directed Graphs,Proc. ACM Symp. on the Theory of Computing, 1989, pp. 297–308.

  2. A. V. Aho, R. Sethi, and J. D. Ullman,Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.

    Google Scholar 

  3. A. V. Aho and J. D. Ullman,Principles of Compiler Design, Addison-Wesley, Reading, MA, 1977.

    Google Scholar 

  4. M. J. Atallah, S. R. Kosaraju, L. L. Larmore, G. L. Miller, and S-H. Teng, Constructing Trees in Parallel, Proc.ACM Symp. on Parallel Algorithms and Architectures, June, 1989, pp. 421–431.

  5. M. Atallah and U. Vishkin, Finding Euler Tours in Parallel,J. Comput. System Sci.,29 (1984), 3303–337.

    Article  MathSciNet  Google Scholar 

  6. D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progressions,Proc. ACM Symp. on the Theory of Computing, 1987, pp. 1–6.

  7. H. N. Gabow and R. E. Tarjan, A Linear Time Algorithm for a Special Case of Disjoint Set Union,J. Comput. System Sci.,30 (1985), 209–221.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. R. Garey and R. E. Tarjan, A Linear Time Algorithm for Finding all Feedback Vertices,Inform. Process. Lett.,7(6) (1978), 274–276.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Gazit and G. L. Miller, An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph,Inform. Process. Lett.,28 (1988), 61–65.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Gibbons, R. Karp, V. Ramachandran, D. Soroker, and R. Tarjan, Transitive Reduction in Parallel Via Branchings, Technical Report CS-TR-171-88, Princeton University, July, 1988.

  11. S. L. Graham and M. Wegman, A Fast and Usually Linear Algorithm for Global Flow Analysis,J. Assoc. Comput. Mach.,23(1) (1976), 172–202.

    MATH  MathSciNet  Google Scholar 

  12. D. Harel, A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems,Proc. ACM Symp. on the Theory of Computing, 1985, pp. 185–194.

  13. M. Hecht,Flow Analysis of Computer Programs, Elsevier, New York, 1977.

    MATH  Google Scholar 

  14. M. S. Hecht and J. D. Ullman, Characterizations of Reducible Flow Graphs,J. Assoc. Comput. Mach.,21 (1974), 367–375.

    MATH  MathSciNet  Google Scholar 

  15. D. S. Hirschberg, Parallel Algorithms for the Transitive Closure and the Connected Components Problems,Proc. ACM Symp. on the Theory of Computing, 1976, pp. 55–57.

  16. R. Karp and V. Ramachandran, A Survey of Parallel Algorithms for Shared-Memory Machines, inHandbook of Theoretical Computer Science, North Holland, Amsterdam, to appear.

  17. T. Lengauer and R. E. Tarjan, A Fast Algorithm for Finding Dominators in a Flow Graph,ACM Trans. Program. Languages Systems,1(1) (1979), 121–141.

    Article  MATH  Google Scholar 

  18. L. Lovasz, Computing Ears and Branchings in Parallel,Proc. IEEE Symp. on Foundations of Computer Science, 1985, pp. 196–205.

  19. J. M. Lucas and M. Gunsher Sackrowitz, Efficient Parallel Algorithms for Path Problems in Directed Graphs,Proc. ACM Symp. on Parallel Algorithms and Architectures, June, 1989, pp. 369–378.

  20. S. R. Pawagi, P. S. Gopalakrishnan, and I. V. Ramakrishnan, Computing Dominators in Parallel,Inform. Process. Lett.,24 (1987), 217–221.

    Article  MATH  MathSciNet  Google Scholar 

  21. P. W. Purdom and E. F. Moore, Algorithm 430: Immediate Predominators in a Directed Graph,Comm. ACM,15(8) (1972), 777–778.

    Article  Google Scholar 

  22. V. Ramachandran, Fast and Processor-Efficient Parallel Algorithms for Reducible Flow Graphs, Tech. Rep. 2257, Department of Engineering, University of Illinois, Urbana, November 1988.

    Google Scholar 

  23. J. Reif, Depth First Search is Inherently Sequential,Inform. Process. Lett.,20 (1985), 229–234.

    Article  MATH  MathSciNet  Google Scholar 

  24. C. Savage, Parallel Algorithms for Some Graph Problems, Tech. Rep. 784, Department of Mathematics, University of Illinois, Urbana, 1977.

    Google Scholar 

  25. G. W. Smith and R. B. Walford, The Identification of a Minimal Feedback Vertex of a Directed Graph,IEEE Trans. Circuits and Systems,22 (1975), 9–15.

    Article  MathSciNet  Google Scholar 

  26. R. Tamassia and J. S. Vitter, Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures,Proc. ACM Symp. on Parallel Algorithms and Architectures, June, 1989, pp. 399–408.

  27. R. E. Tarjan, Finding Dominators in Directed Graphs,SIAM J. Comput.,3(1) (1974), 62–89.

    Article  MATH  MathSciNet  Google Scholar 

  28. R. E. Tarjan, Testing Flow Graph Reducibility,J. Comput. System Sci.,9 (1974), 355–365.

    MATH  MathSciNet  Google Scholar 

  29. R. E. Tarjan and U. Vishkin, An Efficient Parallel Biconnectivity Algorithm,SIAM J. Comput.,14(4) (1985), 862–874.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Hill Center, Rutgers University, 08903, New Brunswick, NJ, USA

    Joan M. Lucas & Marian Gunsher Sackrowitz

Authors
  1. Joan M. Lucas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marian Gunsher Sackrowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Greg N. Frederickson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lucas, J.M., Sackrowitz, M.G. Efficient parallel algorithms for path problems in directed graphs. Algorithmica 7, 631–648 (1992). https://doi.org/10.1007/BF01758780

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01758780

Key words

Search

Navigation