P21: Enumeration of all maximal cliques in a bipartite graph
P21: Enumeration of all maximal cliques in a bipartite graph
Input:
A bipartite graph $G=(V,E)$.
Output:
All maximal bicliques included in $G$.
Complexity:
$O(M(n))$ time delay and $O(n^2)$ space, or $O(\delta^4)$ time delay and $O(n+m)$ space, after $O(nm)$ preprocessing.
Comment:
$M(n)$: the time needed to multiply two $n \times n$ matrices, $\delta$: maximum degree of $G=(V,E)$, $n$: total number of vertices, and $m$: total number of edges.