文章基本信息

标题：Enumerating Minimal Dominating Sets in Triangle-Free Graphs
本地全文：下载
作者：Marthe Bonamy ; Oscar Defrain ; Marc Heinrich 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：126
页码：1-12
DOI：10.4230/LIPIcs.STACS.2019.16
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we prove that this is the case in triangle-free graphs. This answers a question of Kanté et al. Additionally, we show that deciding if a set of vertices of a bipartite graph can be completed into a minimal dominating set is a NP-complete problem.
关键词：Enumeration algorithms; output-polynomial algorithms; minimal dominating set; triangle-free graphs; split graphs