Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel

Abstract In a previous result, the authors showed that a clique tree of a chordal graph can be constructed in O(log n ) parallel computing time with O( n 3 ) processors on CRCW PRAM, where n is the number of nodes of the graph. In this paper, it will be shown that this result can be extended in two ways. First, we show that from the parallel clique tree constructing algorithm, we can derive an exact formula of counting clique trees of a labeled connected chordal graph. Next, we show that a perfect elimination scheme of a chordal graph can be computed in O(log n ) time with O( n 2 ) processors on CREW PRAM once a clique tree of the graph is given. This implies that a perfect elimination scheme of a chordal graph can be computed in O(log n ) time with O( n 3 ) processors on CRCW PRAM.

[1]  G. Dirac.  On rigid circuit graphs , 1961 .

[2]  G. Nemhauser,et al.  Covering, Packing and Generalized Perfection , 1985 .

[3]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[4]  Richard C. T. Lee,et al.  Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs , 1988, Inf. Process. Lett..

[5]  Antoon W. J. Kolen,et al.  The Round-Trip p-Center and Covering Problem on a Tree , 1985, Transp. Sci..

[6]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.

[7]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[8]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[9]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[10]  Moni Naor,et al.  Fast parallel algorithms for chordal graphs , 1987, STOC '87.

[11]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[12]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[13]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[14]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[15]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[16]  Yossi Azar,et al.  Tight Comparison Bounds on the Complexity of Parallel Sorting , 2018, SIAM J. Comput..

[17]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[18]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[19]  D. Rose,et al.  A Separator Theorem for Chordal Graphs , 1982 .

[20]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..