Enumerating minimal dominating sets in chordal bipartite graphs

DOI10.1016/j.dam.2014.12.010zbMath1326.05105MaRDI QIDQ896653

Dieter Kratsch, Petr A. Golovach, Pinar Heggernes, Yngve Villanger, Mamadou Moustapha Kanté

Publication date: 10 December 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.12.010

zbMATH Keywords

enumeration; minimal dominating set; output polynomial algorithm

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)