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 | |
|---|---|---|---|---|
| Edge-based partitioning with vertex separators of oriented graphs | 1 | 257 | October 17, 2022 | |
| Random graphs, fully-connected graphs | 17 | 2518 | May 31, 2020 | |
| [ANN] BoundedDegreeGraphs.jl | 2 | 353 | May 30, 2023 | |
| Trying to identify possible optimizations (or errors) in a graph algorithm | 24 | 1814 | January 31, 2019 | |
| Network structural balance analysis in Julia | 0 | 528 | July 31, 2019 |