I have a graph of N nodes, no edges. I partition the graph pinto two subgraphs with N1 and N2 nodes. I would like to create edges between the two graphs such that the degree distribution in each graph is as close as possible to a prescribed distribution. Is there such an algorithm? I am aware of a few algorithms to create one graph with edges with specified degree distribution. Thanks.