scholarly journals A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Author(s):  
Mamadou Moustapha Kanté ◽  
Vincent Limouzy ◽  
Arnaud Mary ◽  
Lhouari Nourine ◽  
Takeaki Uno
Author(s):  
Mamadou Moustapha Kanté ◽  
Vincent Limouzy ◽  
Arnaud Mary ◽  
Lhouari Nourine ◽  
Takeaki Uno

Author(s):  
Min-Sheng Lin

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.


1982 ◽  
Vol 11 (1) ◽  
pp. 191-199 ◽  
Author(s):  
Kellogg S. Booth ◽  
J. Howard Johnson

2019 ◽  
Vol 783 ◽  
pp. 41-52 ◽  
Author(s):  
Petr A. Golovach ◽  
Dieter Kratsch ◽  
Mathieu Liedloff ◽  
Mohamed Yosri Sayadi

2016 ◽  
Vol 116 (12) ◽  
pp. 739-743 ◽  
Author(s):  
Faisal N. Abu-Khzam ◽  
Pinar Heggernes

2020 ◽  
Vol 278 ◽  
pp. 3-11
Author(s):  
Petr A. Golovach ◽  
Pinar Heggernes ◽  
Dieter Kratsch ◽  
Reza Saei

Author(s):  
Pious Missier ◽  
Anto Kinsley ◽  
Evangeline Prathibha Fernando
Keyword(s):  

2021 ◽  
pp. 130-151
Author(s):  
Martin Charles Golumbic
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document