MI-bicliques

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.