Pages that link to "Item:Q909471"

The following pages link to Fast uniform generation of regular graphs (Q909471):

Displaying 7 items.

• Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
• Approximating degree sequences with regular graphic sequences (extended abstract) (Q283722) (← links)
• A sequential algorithm for generating random graphs (Q603928) (← links)
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
• The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
• Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
• Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy (Q4609600) (← links)