, If D is a minimal dominating set of G containing A, then D \ A ? {x 1 , ¬x 1 , . . . , x n , ¬x n } and it contains at most one literal for each variable
, Notice that Priv(A, v) = {u}. If y Cj belongs to D for some j ? {1, vol.15
m}, D contains at most one of x i and ¬x i , as otherwise Priv(D, neg xi ) would be empty ,
The enumeration of maximal cliques of large graphs, SIAM Journal on Computing, vol.2, issue.1, pp.1-6, 1973. ,
Substructure searching methods: Old and new, Journal of Chemical Information and Computer Sciences, vol.33, issue.4, pp.532-538, 1993. ,
Enumerating maximal independent sets with applications to graph colouring, Operations Research Letters, vol.32, issue.6, pp.547-556, 2004. ,
Linear delay enumeration and monadic second-order logic, Discrete Applied Mathematics, vol.157, issue.12, pp.2675-2700, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00333846
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction, Parameterized and Exact Computation, pp.1-12, 2004. ,
Hypergraph transversal computation and related problems in logic and AI, European Workshop on Logics in Artificial Intelligence, pp.549-564 ,
, , 2002.
New results on monotone dualization and generating hypergraph transversals, SIAM Journal on Computing, vol.32, issue.2, pp.514-537, 2003. ,
Computational aspects of monotone dualization: A brief survey, Discrete Applied Mathematics, vol.156, issue.11, pp.2035-2049, 2008. ,
On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms, vol.21, issue.3, pp.618-628, 1996. ,
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width, Algorithmica, vol.80, issue.2, pp.714-741, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02083480
Enumerating minimal dominating sets in chordal bipartite graphs, Special Issue: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, vol.199, pp.30-36, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-02083515
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets, Algorithmica, vol.72, issue.3, pp.836-859, 2015. ,
Network motif discovery using subgraph enumeration and symmetry-breaking, Annual International Conference on Research in Computational Molecular Biology, pp.92-106, 2007. ,
The Number of Maximal Independent Sets in Triangle-Free Graphs, SIAM Journal on Discrete Mathematics, vol.6, issue.2, pp.284-288, 1993. ,
Enumeration of minimal dominating sets and variants, International Symposium on Fundamentals of Computation Theory, pp.298-309, 2011. ,
On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets, International Symposium on Algorithms and Computation, pp.289-298 ,
, , 2012.
On the Enumeration of Minimal Dominating Sets and Related Notions, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.1916-1929, 2014. ,
On the enumeration and counting of minimal dominating sets in interval and permutation graphs, International Symposium on Algorithms and Computation, pp.339-349, 2013. ,
A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs, In International Workshop on Graph-Theoretic Concepts in Computer Science, pp.138-153, 2015. ,
Minimal Dominating Set Enumeration, Encyclopedia of Algorithms, pp.1-5, 2014. ,
Derivation of Maximal Compatibles Using Boolean Algebra, IBM Journal of Research and Development, vol.8, issue.5, pp.537-538, 1964. ,
An Application: Biological Graph Analysis, Analysis and Enumeration: Algorithms for Biological Graphs, pp.37-44, 2015. ,
Enumeration Algorithms, Analysis and Enumeration: Algorithms for Biological Graphs, pp.13-35, 2015. ,
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions, IRE Transactions on Electronic Computers, EC, vol.8, issue.3, pp.356-367, 1959. ,
Enumeration complexity and matroid decomposition, 2010. ,
Enumeration of the elementary circuits of a directed graph, SIAM Journal on Computing, vol.2, issue.3, pp.211-216, 1973. ,
An efficient search algorithm to find the elementary circuits of a graph, Communications of the ACM, vol.13, issue.12, pp.722-726, 1970. ,
Enumeration of enumeration algorithms, 2016. ,
Substructure similarity search in graph databases, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp.766-777, 2005. ,