A bipartite graph $G$ and an integer $K$ is given. I want to decompose $G$ into $K$ complete bipartite graphs by adding the smallest number of edges.
Below is an example of decomposition when $K=2$. The red line indicates an added edge.
Is there any good (approximation) algorithms?
