Polynomial delay algorithm for listing minimal edge dominating sets in graphs

Abstract

It was proved independently and with different techniques in [Golovach et al. - ICALP 2013] and [Kanté et al. - ISAAC 2012] that there exists an incremental output polynomial algorithm for the enumeration of the minimal edge dominating sets in graphs, i.e., minimal dominating sets in line graphs. We provide the first polynomial delay and polynomial space algorithm for the problem. We propose a new technique to enlarge the applicability of Berge’s algorithm that is based on skipping hard parts of the enumeration by introducing a new search strategy. The new search strategy is given by a strong use of the structure of line graphs.