Parallel Algorithms for Reducible Flow Graphs

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 1-31

  Ramachandran, Vijaya ^a,b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347243105     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0820     Document Type: Article

References (31)

1. K. Abrahamson, N. Dadoun, D. A. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, in "Proceedings, 25th Annual Allerton Conference on Communication, Control and Computing," pp. 624-633, 1987.
2. A. V. Aho and J. D. Ullman, "Principles of Compiler Design," Addison-Wesley, Reading, MA, 1977.
3. F. E. Allen, Program optimization, in "Annual Review of Automatic Programming," Vol. 5, Pergamon, Elmsford, NY, 1969.
4. D. B. Bovet, S. De Agostino, and R. Petreschi, Parallelism and the feedback vertex set problem, Inform. Process. Lett. 28 (1988), 81-85.
5. D. Coppersmith, personal communication, 1988.
6. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, in "Proceedings, 19th Annual ACM Symposium on Theory of Computing, 1987," pp. 1-6.
7. R. W. Floyd, Assigning meanings to programs, in "Proceedings Symposium on Applied Mathematics," Vol. 19, pp. 19-32, 1967.
8. L. R. Ford, Jr., and D. R. Fulkerson, "Flows in Networks," Princeton Univ. Press, Princeton, NJ. 1962.
9. H. Gazit and G. L. Miller, An improved parallel algorithm that computes the bfs numbering of a directed graph, Inform. Proc. Lett. 28 (1988), 61-65.
10. H. 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.
11. R. K. Ghosh and G. P. Bhattacharya, A parallel search algorithm for directed acyclic graphs, BIT 24 (1984), 134-150.
12. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, in "Proceedings, 18th Annual ACM Symposium on Theory of Computing," 136-146, 1986.
13. D. Harel, A linear algorithm for finding dominators in flow graphs and related problems, in "17th Annual ACM Symposium on Theory of Computing," pp. 185-194, 1985.
14. M. S. Hecht and J. D. Ullman, Characterization of reducible flow graphs, J. Assoc. Comput. Mach. 21 (1974), 367-375.
15. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science," (J. Van Leeuwen, Ed.), pp. 869-941, North-Holland, 1990.
16. R. M. Karp, E. Upfal, and A. Wigderson, Constructing a perfect matching is in Random NC, Combinatorica 6 (1986), 35-48.
17. S. R. Kosaraju and A. L. Delcher, Optimal parallel evaluation of tree-structured computations by raking, in "Proceedings, 3rd Aegean Workshop on Computing," Lecture Notes in Computer Science, Vol. 319, 101-110, Springer-Verlag, Berlin/New York, 1988.
18. J. M. Lucas and M. G. Sackrowitz, Efficient parallel algorithms for path problems in directed graphs, Algorithmica 7 (1992), 631-648.
19. G. L. Miller and J. H. Reif, Parallel tree contraction and its application, in "Proceedings, 26th Annual IEEE Symposium on Foundations of Computer Science," 478-489, 1985.
20. K. Mulmuley, U. Vazirani, and V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7 (1989), 101-104.
21. J. Naor, M. Naor, and A. A. Schaffer, Fast parallel algorithms for chordal graphs, SIAM J. Comput. 18 (1989), 327-349.
22. C. H. Papadimitriou and K. Steiglitz, "Combinatorial Optimization: Algorithms and Complexity," Prentice-Hall, Englewood Cliffs, NJ, 1982.
23. S. R. Pawagi, P. S. Gopalakrishnan, and I. V. Ramakrishnan, Computing dominators in parallel, Inform. Process. Lett. 24 (1987), 217-221.
24. V. Ramachandran, Finding a minimum feedback arc set in reducible flow graphs, J. Algorithms 9 (1988), 299-313.
25. V. Ramachandran, The complexity of minimum cut and maximum flow problems in an acyclic network, Networks, 17 (1987), 387-392.
26. V. Ramachandran, Fast parallel algorithms for reducible flow graphs, in "Concurrent Computations: Algorithms, Architecture and Technology," (S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz, Eds.), pp. 117-138, Plenum Press, New York, 1988.
27. V. Ramachandran, A minimax arc theorem for reducible flow graphs, SIAM J. Discrete Math 3 (1990), 554-560.
28. A. Shamir, A linear time algorithm for finding minimum cutsets in reducible graphs, SIAM J. Comput. 8 (1979), 645-655.
29. R. E. Tarjan, Testing flow graph reducibility, J. Comput. System Sci. 9 (1974), 355-365.
30. R. E. Tarjan, "Data Structures and Network Algorithms," SIAM, Philadelphia, PA, 1983.
31. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985), 862-874.