|
This article is cited in 1 scientific paper (total in 1 paper)
On problem of finding all maximal induced bicliques of hypergraph
Aleksandr A. Soldatenko, Daria V. Semenova Siberian Federal University, Krasnoyarsk, Russian Federation
Abstract:
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.
Keywords:
hypergraph, maximal induced bicliques, search algorithm.
Received: 10.03.2021 Received in revised form: 21.05.2021 Accepted: 20.06.2021
Citation:
Aleksandr A. Soldatenko, Daria V. Semenova, “On problem of finding all maximal induced bicliques of hypergraph”, J. Sib. Fed. Univ. Math. Phys., 14:5 (2021), 638–646
Linking options:
https://www.mathnet.ru/eng/jsfu950 https://www.mathnet.ru/eng/jsfu/v14/i5/p638
|
Statistics & downloads: |
Abstract page: | 66 | Full-text PDF : | 25 | References: | 11 |
|