Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

It was proved independently and with different techniques in [Golovach et al. - ICALP 2013] and [Kante 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.

[1]  Lhouari Nourine,et al.  On the Enumeration of Minimal Dominating Sets and Related Notions , 2014, SIAM J. Discret. Math..

[2]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[3]  Fedor V. Fomin,et al.  Enumerating Minimal Subset Feedback Vertex Sets , 2011, Algorithmica.

[4]  Benno Schwikowski,et al.  On enumerating all minimal solutions of feedback problems , 2002, Discret. Appl. Math..

[5]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.

[6]  KEN TAKATA,et al.  A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph , 2007, SIAM J. Discret. Math..

[7]  Elias C. Stavropoulos,et al.  Journal of Graph Algorithms and Applications an Efficient Algorithm for the Transversal Hypergraph Generation , 2022 .

[8]  Vladimir Gurvich,et al.  Generating Cut Conjunctions in Graphs and Related Problems , 2007, Algorithmica.

[9]  Vladimir Gurvich,et al.  On Enumerating Minimal Dicuts and Strongly Connected Subgraphs , 2007, Algorithmica.

[10]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[11]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[12]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS '97.

[13]  Vladimir Gurvich,et al.  Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms , 2006, J. Graph Theory.

[14]  Yann Strozecki,et al.  Enumeration complexity and matroid decomposition , 2010 .

[15]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[16]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[17]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[18]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..

[19]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.

[20]  Petr A. Golovach,et al.  An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets , 2013, ICALP.

[21]  Takeaki Uno,et al.  Efficient algorithms for dualizing large-scale hypergraphs , 2011, Discret. Appl. Math..

[22]  Lhouari Nourine,et al.  Enumeration of Minimal Dominating Sets and Variants , 2011, FCT.

[23]  Vladimir Gurvich,et al.  Generating All Vertices of a Polyhedron Is Hard , 2006, SODA '06.

[24]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[25]  Takeaki Uno,et al.  On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs , 2013, ISAAC.

[26]  Jean-Marc Petit,et al.  Extending Set-based Dualization: Application to Pattern Mining , 2012, ECAI.

[27]  Georg Gottlob,et al.  New Results on Monotone Dualization and Generating Hypergraph Transversals , 2003, SIAM J. Comput..

[28]  Vladimir Gurvich,et al.  An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation , 2006, Discret. Appl. Math..

[29]  Fedor V. Fomin,et al.  Enumerating Minimal Subset Feedback Vertex Sets , 2011, WADS.

[30]  Lhouari Nourine,et al.  On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets , 2012, ISAAC.

[31]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.