P224: Enumeration of all maximal bicliques in a bipartite graph

P224: Enumeration of all maximal bicliques in a bipartite graph

Input:

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

Output:

All maximal bicliques in $G$ in lexicographical order on $U$.

Complexity:

$O((|U| + |V|)^2)$ delay with exponential space.

Comment:

Reference:

[Gely2009] (Bibtex)