Efficient parallel algorithms for chordal graphs

SIAM Journal on Computing

Volumn 25, Issue 4, 1996, Pages 797-827

  Klein, Philip N ^a  

^a Brown Univerity   (United States)

Author keywords

Chordal graphs; Interval graphs; Parallel algorithms; Perfect elimination ordering; PQ tree

Indexed keywords

EID: 0005931834     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539789166880     Document Type: Article

References (44)

1. A. AHO, J. HOPCROFT, AND J. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. AGGARWAL AND R. ANDERSON, A random NC algorithm for depth first search, Combinatorica, 8 (1988), pp. 1-12.
3. R. J. ANDERSON AND G. L. MILLER, A simple randomized parallel algorithm for list-ranking, Inform. Process. Lett., 33 (1990), p. 33.
4. C. BEERI, R. FAGIN, D. MAIER, AND M. YANNAKAKIS, On the desirability of acyclic database schemes, J. Assoc. Comput. Mach., 30 (1983), pp. 479-513.
5. C. BERGE, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
6. K. S. BOOTH AND G. S. LUEKER, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
7. N. CHANDRASEKHARAN AND S. S. IYENGAR, NC algorithms for recognizing chordal graphs and k-trees, Technical report 86-020, Department of Computer Science, Louisiana State University, Baton Rouge, LA, (1986).
8. C. J. COLBOURN AND K. S. BOOTH, Linear time automorphism algorithms for trees, interval graphs, and planar graphs, SIAM J. Comput., 10 (1981), pp. 203-225.
9. R. COLE, Parallel merge sort, SIAM J. Comput., 17 (1988), pp. 770-785.
10. R. COLE AND U. VISHKIN, Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput., 17 (1988), pp. 128-142.
11. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, SIAM J. Comput., 11 (1982), pp. 472-492.
12. E. DAHLHAUS AND M. KARPINSKI, The matching problem for strongly chordal graphs is in NC, Technical report 855-CS, Institut für Informatik, Universität Bonn, Bonn, Germany, 1986.
13. _, Fast parallel computation of perfect and strongly perfect elimination schemes, Technical report 8519-CS, Institut für Informatik, Universität Bonn, Bonn, Germany, 1987.
14. G. A. DIRAC, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71-76.
15. A. EDENBRANDT, Combinatorial problems in matrix computation, TR-85-695 (Ph.D. thesis), Department of Computer Science, Cornell University, Ithaca, NY, 1985.
16. _, Chordal graph recognition is in NC, Inform. Process. Lett., 24 (1987), pp. 239-241.
17. D. FULKERSON AND O. GROSS, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), pp. 835-855.
18. F. GAVRIL, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. Comput., 1 (1972), pp. 180-187.
19. H. GAZIT, An optimal randomized parallel algorithm for finding connected components in a graph, SIAM J. Comput., 20 (1991), pp. 1046-1067.
20. H. GAZIT AND G. L. MILLER, An improved parallel algorithm that computes the BFS numbering of a directed graph. Inform. Process. Lett., 28 (1988), pp. 61-65.
21. J. R. GILBERT, D. J. ROSE, AND A. EDENBRANDT, A separator theorem for chordal graphs, SIAM J. Algebraic Discrete Meth., 5 (1984), pp. 306-313.
22. P. C. GILMORE AND A. J. HOFFMAN, A characterization of comparability graphs and of interval graphs, Canad. J. Math., 16 (1964), pp. 539-548.
23. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
24. C.-W. HO AND R. C. T. LEE, Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs, Inform. Process. Lett., 28 (1988), pp. 301-309.
25. _, Counting clique trees and computing perfect elimination schemes in parallel, Inform. Process. Lett., 31 (1989), pp. 61-68.
26. J. HOPCROFT AND J. WONG, Linear time algorithm for isomorphism of planar graphs, in Proc. 6th Annual ACM Symposium on Theory of Computing Association for Computing Machinery, New York, 1974, pp. 172-184.
27. P. N. KLEIN, Efficient parallel algorithms for planar, chordal, and interval graphs, TR-426 (Ph.D. thesis), Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1988.
28. _, Efficient parallel algorithms for chordal graphs, in Proc. 29th Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 150-161.
29. P. N. KLEIN AND J. H. REIF, An efficient parallel algorithm for planarity, J. Comput. System Sci., 37 (1988), pp. 190-246.
30. D. KOZEN, U. VAZIRANI, AND V. VAZIRANI, NC algorithms for comparability graphs,and testing for unique perfect matching, in Proc. 5th Symposium Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 206, Springer-Verlag, New York, 1985, pp. 496-503.
31. R. E. LADNER AND M. J. FISCHER, Parallel Prefix Computation, J. Assoc. Comput. Mach., 27 (1980), pp. 831-838.
32. G. S. LUEKER AND K. S. BOOTH, A linear time algorithm for deciding interval graph isomorphism, J. Assoc. Comput. Mach., 26 (1979), pp. 183-195.
33. G. L. MILLER AND J. H. REIF, Parallel tree contraction and its application, in Proc. 26th Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 478-489.
34. J. NAOR, M. NAOR, AND A. A. SCHÄFFER, Fast parallel algorithms for chordal graphs, SIAM J. Comput., 18 (1989), pp. 327-349.
35. M. B. NOVICK, personal communication, 1987.
36. _, personal communication, 1988.
37. _, Logarithmic time parallel algorithms for recognizing comparability and interval graphs, Technical report TR89-1015, Department of Computer Science, Cornell University, Ithaca, NY, 1989.
38. J. H. REIF AND S. RAJASEKARAN, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput., 18 (1989), pp. 594-607.
39. D. J. ROSE, Triangulated graphs and the elimination process, J. Math. Anal. Appl., 32 (1970), pp. 597-609.
40. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
41. J. E. SAVAGE AND M. G. WLOKA, A parallel algorithm for channel routing, in Graph-Theoretic Concepts in Computer Science, J. van Leeuwen, ed., Lecture Notes in Comput. Sci. 344, Springer-Verlag, New York, 1988, pp. 288-301.
42. R. SCHREIBER, A new implementation of sparse Gaussian elimination, ACM Trans. Math. Software, 8 (1982), pp. 256-276.
43. Y. SHILOACH AND U. VISHKIN, An O(log n) parallel connectivity algorithm, J. Algorithms, 3 (1982), pp. 57-67.
44. R. E. TARJAN AND U. VISHKIN, Finding biconnected components and computing tree functions in logarithmic parallel time, SIAM J. Comput., 14 (1975), pp. 862-874.