minorminer.busclique.busgraph_cache.largest_balanced_biclique

busgraph_cache.largest_balanced_biclique()

Returns the largest-size biclique where both sides have equal size.

Nodes of the embedding dict are from range(len(embedding)), where the nodes range(len(embedding)/2) are completely connected to the nodes range(len(embedding)/2, len(embedding)).

This will compute the entire biclique cache if it is missing from the filesystem.

Returns

An embedding of node labels (described above) mapped to chains of the largest balanced biclique.

Return type

dict