Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants

DOI10.1145/3386686zbMath1484.68153arXiv1810.00789MaRDI QIDQ4987460

Michał Pilipczuk, Jean-Florent Raymond, Marthe Bonamy, Marc Heinrich, Oscar Defrain

Publication date: 3 May 2021

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

forbidden induced subgraphs; minimal dominating sets; algorithmic enumeration

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C30: Enumeration in graph theory

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