On the dualization in distributive lattices and related problems
share
In this paper, we study the dualization in distributive lattices, a generalization of the well known hypergraph dualization problem. We give a characterization of the complexity of the problem under various combined restrictions on graph classes and posets, including bipartite, split and co-bipartite graphs, and variants of neighborhood inclusion posets. In particular, we show that while the enumeration of minimal dominating sets is possible with linear delay in split graphs, the problem gets as hard as for general graphs in distributive lattices. More surprisingly, this result holds even when the poset coding the lattice is only comparing vertices of included neighborhoods in the graph. If both the poset and the graph are sufficiently restricted, we show that the dualization becomes tractable relying on existing algorithms from the literature.
READ FULL TEXT