This is just here as a test because I lose it
Term information
definition
algorithm for the mining of bicliques/complete bipartite graphs "In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set. A complete bipartite graph, G := (V1 + V2, E), is a bipartite graph such that for any two vertices, v1 source: http://en.wikipedia.org/wiki/Biclique