Given a degree distribution, how fast can we construct a graph that follows the given degree distribution? A link or algorithm sketch would be good. The algorithm should report a no incase no graph can be constructed and any one example if multiple graphs can be constructed.
Reconstructing Graphs from Degree Distribution
algorithms;graphs;graph theory
If you mean how to construct such a simple graph (no self loops and no parallel edges), maybe Havel-Hakimi theorem is what you are looking for. You can google it yourself, and the wikipedia page Degree (graph theory) is also helpful.