r37980778c78--b43541b1cc70854e9a00ca9b821c0e62

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.

Tags
Data and Resources
To access the resources you must log in

This item has no data

Identity

Description: The Identity category includes attributes that support the identification of the resource.

Field Value
PID https://www.doi.org/10.5281/zenodo.1238879
URL http://dx.doi.org/10.5281/zenodo.1238879
URL https://figshare.com/articles/MI-bicliques/7301345
Access Modality

Description: The Access Modality category includes attributes that report the modality of exploitation of the resource.

Field Value
Access Right Open Source
Publishing

Description: Attributes about the publishing venue (e.g. journal) and deposit location (e.g. repository)

Field Value
Collected From figshare
Hosted By figshare
Publication Date 2018-11-05
Additional Info
Field Value
Language UNKNOWN
Resource Type Software
keyword bicliques, odd cycle transversal, parameterized algorithms, enumeration, bipartite graphs
system:type software
Management Info
Field Value
Source https://science-innovation-policy.openaire.eu/search/software?softwareId=r37980778c78::b43541b1cc70854e9a00ca9b821c0e62
Author jsonws_user
Last Updated 17 December 2020, 22:35 (CET)
Created 17 December 2020, 22:35 (CET)