A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 investigate this problem in graph classes defined by forbidding an induced subgraph. In particular, we provide output-polynomial time algorithms for K_t-free graphs and variants. This answers a question of Kanté et al. about enumeration in bipartite graphs.arXiv:1810.00789v3 fatcat:taj6kwocujfxbp5gtrrsquzz3y