Summary of complexities of enumeration problems.md
... ...
@@ -3,4 +3,4 @@ We will describe the results of complexities of enumeration problems
3 3
4 4
* (Minimal dominating set) and (minimal hitting sets) are equivalent [M. M. Kanté, V. Limouzy, A. Mary and L. Nourine, "On the enumeration of minimal dominating sets and related notions.", SIAM Journal on Discrete Mathematics, vol.28, no.4, pp.1916-1929, 2014]
5 5
* (Minimal dominating set) and (total minimal dominating sets) are equivalent [M. M. Kanté, V. Limouzy, A. Mary and L. Nourine, "On the enumeration of minimal dominating sets and related notions.", SIAM Journal on Discrete Mathematics, vol.28, no.4, pp.1916-1929, 2014]
6
-* ...
... ...
\ No newline at end of file
0
+* If there is an output-polynomial time algorithm for (minimal connected vertex cover enumeration on bipartite graph), then there is an output-polynomial time algorithm for (minimal transversal) []
... ...
\ No newline at end of file