P280: Enumeration of all bicliques in a graph in lexicographical order

P280: Enumeration of all bicliques in a graph in lexicographical order

Input:

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

Output:

All bicliques in $G$.

Complexity:

$O(|V|^3)$ delay and $O(2^{|V|})$ space.

Comment:

There is no polynomial-delay enumeration algorithm for all bicliques in reverse lexicographical order unless $P = NP$.

Reference:

[Dias2005] (Bibtex)