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.
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Learning (a)synchronous parallelization on a simple graph problem | 8 | 501 | March 5, 2023 | |
| Dynamic graphs | 3 | 796 | July 15, 2020 | |
| Bipartite networks | 2 | 548 | August 26, 2021 | |
| Edge-based partitioning with vertex separators of oriented graphs | 1 | 257 | October 17, 2022 | |
| Create a (Di)graph from an iterator over edges with a certain number of vertices | 2 | 324 | August 13, 2023 |