Given a biregular graph, how to find the maximum edge complete bipartite/biclique subgraph with a given number of vertices on one side?

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.

Solution

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

4SUM variation in quadratic complexity (Python 3.5)
All possible decision paths / outcomes given multiple choices at each decision
Why is accessing any single element in an array done in constant time ( O(1) )?
Rolling or sliding window iterator?
Iterative tree walking
Java, sorting analysis. Heapsort, Quicksort1, Quicksort2, Mergesort, given a blackbox
Optimal algorithm for returning top k values from an array of length N
Fast algorithm to spread bits of u8 to the LSBs of each byte of a u64
How to improve Knight's tour with Warnsdorff's rule?
Euclidean greatest common divisor for more than two numbers
Binary search for first occurrence of k
Find next prime given all prior
What algorithm gives suggestions in a spell checker?
How to find different k-grams of a string using a suffix array?
Understanding Time complexity calculation for Dijkstra Algorithm
consecutive pairs divisible by 3
Algorithm to subdivide a polygon in smaller polygons
Difference between Big-O and Little-O Notation
What exactly does the while loop do here in insertion sort?
Time only parts of programs of various languages
How do I check if an array includes a value in JavaScript?
General method for calculating Smooth vertex normals with 100% smoothness
Fastest way to find the smallest possible sum of the absolute differences of pairs within a single array?
Console select menu in python
What's the fastest algorithm for sorting a linked list?
print matrix in spiral order recursively
Match indexes from 1 to n with n given arrays so that sum of elements is minimal
Remove characters from the second string which are present in the first string
Finding maximum groups in less time complexity
How to convert floats to human-readable fractions?