For example,I have a biregular graph G(E,L∪R).The problem is I'd like to find the maximum edge complete bipartite subgraph K(E',S∪T) with a given cardinality of S or T.Please recommend relevant literature to me soon.

CodePudding user response：

There's a straightforward reduction from clique-finding, making this NP-hard and hard to approximate.