Siberian Federal University 
- Issue
- Journal of Siberian Federal University. Mathematics & Physics. 2021 14 (5)
- Authors
- Soldatenko, Aleksandr A.; Semenova, Daria V.
- Contact information
- Soldatenko, Aleksandr A.: Siberian Federal University Krasnoyarsk, Russian Federation; OCRID: 0000-0001-6708-4753; Semenova, Daria V.: Siberian Federal University Krasnoyarsk, Russian Federation; OCRID: 0000-0002-8670-2921
- Keywords
- hypergraph; maximal induced bicliques; search algorithm
- Abstract
The problem of finding all maximal induced bicliques of a hypergraph is considered in this paper. A theorem about connection between induced bicliques of the hypergraph H and corresponding vertex graph L2(H) is proved. An algorithm for finding all maximal induced bicliques is proposed and computational experiments with its applying are presented
- Pages
- 638–646
- DOI
- 10.17516/1997-1397-2021-14-5-638-646
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/143739
Journal of Siberian Federal University. Mathematics & Physics / On Problem of Finding all Maximal Induced Bicliques of Hypergraph
Full text (.pdf)