P267: Enumeration of all minimal vertex covers of size at most $k$ in a graph

P267: Enumeration of all minimal vertex covers of size at most $k$ in a graph

Input:

A graph $G = (V, E)$.

Output:

All minimal vertex covers of size at most $k$ in $G$.

Complexity:

$O(|E| + k^2 2^k)$ total time.

Comment:

Reference:

[Damaschke2006] (Bibtex)