On Problem of Finding all Maximal Induced Bicliques of Hypergraph

DOI10.17516/1997-1397-2021-14-5-638-646zbMath1504.05204OpenAlexW4205667727MaRDI QIDQ5071398

Aleksandr A. Soldatenko, Daria V. Semenova

Publication date: 21 April 2022

Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/jsfu950

zbMATH Keywords

hypergraphsearch algorithmmaximal induced bicliques

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• Consensus algorithms for the generation of all maximal bicliques
• Hypergraph theory. An introduction
• Efficient enumeration of maximal induced bicliques
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
• Bipartite bihypergraphs: a survey and new results
• HYPERGRAPHS
• Comparing performance of algorithms for generating concept lattices
• On the Addressing Problem for Loop Switching
• Bicliques in graphs. I: Bounds on their number
• Application of hypergraph theory in chemistry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Problem of Finding all Maximal Induced Bicliques of Hypergraph