9 citations · 17 across the 5 of their papers we have counts for
1 paper · 2 filters
Alexander Barvinok, J. A. Hartigan
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient…