Table 1 Previously presented graph algorithms for maximal biclique enumeration
Algorithms | Inputs | Outputs | Methods |
|---|---|---|---|
Sanderson et al. [9] | Bipartite graph | Maximal bicliques of bounded minimum size | Exhaustive search by iterative biclique building |
Mushlin et al. [13] | Bipartite graph | Maximal bicliques of bounded sizes and figure-of-merit values | Exhaustive search with a priority queue |
Zaki et al. [21] | Bipartite graph | Maximal bicliques (one partition) | Frequent closed itemset mining in transaction databases |
Uno et al. [25] (LCM/LCM2) | Bipartite graph | Maximal bicliques (one partition) | Frequent closed itemset mining |
Li et al. [26] (LCM-MBC) | Bipartite graph | Maximal bicliques | Frequent closed itemset mining |
Makino & Uno [18] | Bipartite graph | Maximal bicliques | Maximal clique finding in general graphs |
Tomita et al. [30] | General graph | Maximal cliques | Maximal clique finding in general graphs |
Eppstein [17] | General graph of bounded arboricity | Maximal bicliques | Exhaustive search |
Alexe et al. [27] (MICA) | General graph | Maximal bicliques | A consensus algorithm |
Liu et al. [28] (MineMBC) | General graph | Maximal bicliques of bounded minimum size | A divide-and-conquer approach |