Version 2.0.0

This release incorporates C++ implementations of several algorithms for enumerating maximal bicliques, in both the induced and non-induced settings. For maximal induced bicliques, we introduce OCT-MIB-II which is engineered for near-bipartite graphs and empirically outperforms the existing algorithm for this setting (OCT-MIB), and Enum-MIB a more general algorithm similar to Lex-MIB without a lexicographic guarantee. In the non-induced setting, the package now includes OCT-MICA, a new variant of consensus approach described in Alexe et. al 2004 optimized for near-bipartite graphs, and a reference implementation of the original MICA algorithm.

Version 1.0.0

Initial release of MI-bicliques: Algorithms for enumerating maximal induced bicliques.
MI-bicliques is a C++ software package implementing algorithms for efficiently enumerating all maximal induced bicliques (MIBs) in a general graph. The initial release includes two algorithms: OCT-MIB and LexMIB. The OCT-MIB method is designed to run more efficiently in near-bipartite graphs, and uses an odd cycle transversal (OCT). LexMIB implements a variant of the algorithm described in Dias et. al 2014 for enumerating all MIBs in lexicographic order.