## 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.

Original language | English |
---|---|

Pages (from-to) | 61-68 |

Number of pages | 8 |

Journal | Information Processing Letters |

Volume | 31 |

Issue number | 2 |

DOIs | |

State | Published - 26 Apr 1989 |

## Keywords

- chordal graphs
- clique trees
- CRCW PRAM
- CREW PRAM
- Parallel processing