P505: Enumerate all maximal edge bipartite subgraphs in a graph

P505: Enumerate all maximal edge bipartite subgraphs in a graph

Input:

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

Output:

All maximal edge bipartite subgraphs in $G$.

Complexity:

$O(|E|^3)$ delay.

Comment:

Exponential space. Proximity search.

Reference:

[Conte2019] (Bibtex)