On problem of finding all maximal induced bicliques of hypergraph

The problem of finding all maximal induced bicliques of a hypergraph is considered in this paper. Theorem on connection between induced bicliques of the hypergraph $H$ and corresponding vertex graph $L_2(H)$ is proved. An algorithm for finding all maximal induced bicliques is proposed. Results of computational experiments with the use of the proposed algorithm are presented.