Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
Keyword(s):
Counting dominating sets (DSs) in a graph is a #P-complete problem even for chordal bipartite graphs and split graphs, which are both subclasses of weakly chordal graphs. This paper investigates this problem for distance-hereditary graphs, which is another known subclass of weakly chordal graphs. This work develops linear-time algorithms for counting DSs and their two variants, total DSs and connected DSs in distance-hereditary graphs.
2019 ◽
Vol 11
(06)
◽
pp. 1950074
Keyword(s):
2005 ◽
Vol 145
(3)
◽
pp. 479-482
◽
Keyword(s):
1996 ◽
Vol 58
(3)
◽
pp. 111-115
◽
2007 ◽
Vol 381
(1-3)
◽
pp. 57-67
◽
2020 ◽
Vol 28
(3)
◽
pp. 153-170
Keyword(s):