We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the time complexity. On the other hand, we prove that counting the number of dominating sets (and minimum dominating sets) in split graphs and chordal bipartite graphs is #P-complete. These results are in vivid contrast with the recent results on counting the independent sets and the matchings in chordal graphs and chordal bipartite graphs. © 2011 Springer-Verlag.
CITATION STYLE
Kijima, S., Okamoto, Y., & Uno, T. (2011). Dominating set counting in graph classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6842 LNCS, pp. 13–24). https://doi.org/10.1007/978-3-642-22685-4_2
Mendeley helps you to discover research relevant for your work.