The parallel solution of domination problems on chordal and strongly chordal graphs

AbstractWe present efficient parallel algorithms for the domination problem on strongly chordal graphs and related problems, such as the set cover problem for α-acyclic hypergraphs and the dominating clique problem for strongly chordal graphs. Moreover, we present an efficient parallel algorithm which checks, for any chordal graph, whether it has a dominating clique