P291: Enumeration of all maximal independent sets of a graph

P291: Enumeration of all maximal independent sets of a graph

Input:

A graph $G = (V, E)$ and a position integer $k$.

Output:

Enumeration of all maximal independent sets with at most size $k$ of $G$.

Complexity:

$O(3^{4k-|V|} 4^{|V|-3k})$ total time.

Comment:

Reference:

[Eppstein2003a] (Bibtex)