## Efficient parallel algorithms for chordal graphs

by
Philip N. Klein

Citations: | 27 - 0 self |

### BibTeX

@MISC{Klein_efficientparallel,

author = {Philip N. Klein},

title = {Efficient parallel algorithms for chordal graphs},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

We give the first efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to our results is an efficient parallel algorithm for finding a perfect elimination ordering.