Biclique
Материал из WikiGrapp
Biclique --- биклика.
1. In a bipartite graph [math]\displaystyle{ G = (V,W,E) }[/math], a subset [math]\displaystyle{ A \subseteq V \cup W }[/math] is called a biclique if it induces a complete bipartite graph.
2. Given a graph, this is an inclusion-maximal induced complete bipartite subgraph of a graph.
