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

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

0.00 Avg rating—0 Votes
Article ID: iaor19951086
Country: Netherlands
Volume: 52
Issue: 3
Start Page Number: 261
End Page Number: 273
Publication Date: Aug 1994
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

The authors 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, they present an efficient parallel algorithm which checks, for any chordal graph, whether it has a dominating clique.

Reviews

Required fields are marked *. Your email address will not be published.