Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints

TL;DR

This paper presents polynomial-delay algorithms for enumerating minimal vertex covers and dominating sets with capacity and connectivity constraints on bounded-degree graphs, extending to certain classes and establishing complexity bounds.

Contribution

It introduces new polynomial-delay enumeration algorithms for constrained minimal vertex covers and dominating sets, including extensions to d-claw free and general graphs.

Findings

Algorithms run in polynomial delay on bounded-degree graphs.

Extended algorithms to d-claw free graphs and quasi-polynomial time on general graphs.

Complexity results show certain problems are as hard as enumerating minimal hypergraph transversals.

Abstract

In this paper, we consider the problems of enumerating minimal vertex covers and minimal dominating sets with capacity and/or connectivity constraints. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs. For the case of minimal connected vertex covers, our algorithms run in polynomial delay even on the class of $d$-claw free graphs, extending the result on bounded-degree graphs, and in output quasi-polynomial time on general graphs. To complement these algorithmic results, we show that the problems of enumerating minimal connected vertex covers, minimal connected dominating sets, and minimal capacitated vertex covers in $2$-degenerated bipartite graphs are at least as hard as enumerating minimal transversals in hypergraphs.