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

DOI10.1007/978-3-662-53174-7_11zbMath1417.05215arXiv1407.2036MaRDI QIDQ2827808

Lhouari Nourine, Takeaki Uno, Mamadou Moustapha Kanté, Arnaud Mary, Vincent Limouzy

Publication date: 21 October 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.2036

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

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