Polynomial-delay enumeration of minimal dominating sets in bipartite graphs
Establish whether the minimal dominating sets of arbitrary bipartite graphs can be enumerated with polynomial delay.
References
Still the problem is not known to admit a polynomial-delay algorithm.
— Enumerating minimal dominating sets and variants in chordal bipartite graphs
(2502.14611 - Castelo et al., 20 Feb 2025) in Section 1, paragraph beginning “Note that, in the literature”
Still the problem is not known to admit a polynomial-delay algorithm.
— Enumerating minimal dominating sets and variants in chordal bipartite graphs
(2502.14611 - Castelo et al., 20 Feb 2025) in Section 1, paragraph beginning “Note that, in the literature”
For example, bipartite graphs already admit an output-polynomial-time algorithm, while polynomial delay remains open; polynomial delay has recently been obtained for chordal bipartite graphs.
— An ETH-based quasipolynomial lower bound for Dualization
(2610.11473 - Kobayashi et al., 8 Oct 2026) in Section Discussion