Algorithm of finding all maximal induced bicliques of hypergraph
Aleksandr Soldatenko, Daria Semenova
15m
The problem of finding all maximal induced bicliques of a hypergraph is considered in this paper. An algorithm for finding all maximal induced bicliques is proposed and computational experiments with its applying are presented.