kkloste / mi-bicliques Goto Github PK
View Code? Open in Web Editor NEWThis project forked from theoryinpractice/mi-bicliques
Algorithms for enumerating maximal induced bicliques. OCT-MIB is designed for graphs which are "near bipartite" described in Kloster et al. 2018+; LexMIB is an improved version of the algorithm described in Dias et al. 2005.
License: BSD 3-Clause "New" or "Revised" License