P375: Enumeration of all maximal independent sets in an undirected graph

P375: Enumeration of all maximal independent sets in an undirected graph

Input:

A graph $G$.

Output:

All maximal independent sets in $G$ in lexicographically.

Complexity:

Comment:

Reference:

[Loukakis1981] (Bibtex)