On Problem of Finding all Maximal Induced Bicliques of Hypergraph
-
Published:2021-10
Issue:5
Volume:14
Page:638-646
-
ISSN:1997-1397
-
Container-title:Journal of Siberian Federal University. Mathematics & Physics
-
language:
-
Short-container-title:J. Sib. Fed. Univ., Math. phys.
Author:
Soldatenko Aleksandr A., ,Semenova Daria V.
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
Publisher
Siberian Federal University
Subject
General Physics and Astronomy,General Mathematics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献