Efficient parallel algorithms for chordal graphs

Authors:
P. N. Klein
Affiliations:
Harvard Univ., Cambridge, MA, USA
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 2

Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Parallel Recognition of Doubly Chordal Graphs

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97

Quantified Score

Hi-index	0.00

Visualization

Abstract

The author gives 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 the results is an efficient parallel algorithm for finding a perfect elimination ordering.