无kt图及其变体中的极小支配集枚举

ACM Transactions on Algorithms (TALG) Pub Date : 2018-10-01 DOI:10.1145/3386686

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

{"title":"无kt图及其变体中的极小支配集枚举","authors":"Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond","doi":"10.1145/3386686","DOIUrl":null,"url":null,"abstract":"It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this article we investigate this problem in graph classes defined by forbidding an induced subgraph. In particular, we provide output-polynomial time algorithms for Kt-free graphs and for several related graph classes. This answers a question of Kanté et al. about enumeration in bipartite graphs.","PeriodicalId":154047,"journal":{"name":"ACM Transactions on Algorithms (TALG)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants\",\"authors\":\"Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond\",\"doi\":\"10.1145/3386686\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this article we investigate this problem in graph classes defined by forbidding an induced subgraph. In particular, we provide output-polynomial time algorithms for Kt-free graphs and for several related graph classes. This answers a question of Kanté et al. about enumeration in bipartite graphs.\",\"PeriodicalId\":154047,\"journal\":{\"name\":\"ACM Transactions on Algorithms (TALG)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Algorithms (TALG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3386686\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Algorithms (TALG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3386686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

图的最小支配集能否在输出多项式时间内被枚举是一个长期开放的问题。在本文中，我们研究了通过禁止诱导子图定义的图类中的这个问题。特别是，我们为无kt图和几个相关的图类提供了输出多项式时间算法。这回答了kant等人关于二部图中枚举的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants

It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this article we investigate this problem in graph classes defined by forbidding an induced subgraph. In particular, we provide output-polynomial time algorithms for Kt-free graphs and for several related graph classes. This answers a question of Kanté et al. about enumeration in bipartite graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Transactions on Algorithms (TALG)

自引率

0.00%

发文量

期刊最新文献

Generic Techniques for Building Top-k Structures Deterministic Leader Election in Anonymous Radio Networks A Learned Approach to Design Compressed Rank/Select Data Structures k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms Fully Dynamic (Δ +1)-Coloring in O(1) Update Time