P76: Enumeration of all maximum independent sets of a bipartite graph

P76: Enumeration of all maximum independent sets of a bipartite graph

Input:

A bipartite graph $B =(V, E)$.

Output:

All maximum independent sets of $B$.

Complexity:

$O(|V|^{2.5} + \gamma)$.

Comment:

$\gamma$ is the output size, that is the sum of the all solutions.

Reference:

[Kashiwabara1992] (Bibtex)