Given the degree sequence, is there an algorithm that can return a graph G which satisfies the degree sequence?
There can be more than one graph available for a degree sequence. It is enough if the algorithm returns only one of them.
Assume: Undirected graph, no weights, not a multi-graph(only one edge between 2 vertices).