python - Finding largest biclique containing certain vertex -
given bipartite graph g , selected vertice v, want find maximal biclique v belongs to.
i appreciate if shows me algorithm, implementation or paper problem.
take of v's neighbors 1 side of biclique, , take intersection of of v's neighbors' sets of neighbors other side. result maximal biclique containing v.
Comments
Post a Comment