scientific article; zbMATH DE number 3654183
From MaRDI portal
Publication:3853680
Cited in
(9)- Approximate counting, uniform generation and rapidly mixing Markov chains
- Uniform generation of spanning regular subgraphs of a dense graph
- Refining the phase transition in combinatorial search
- On the effective generation of set elements within specified ranges
- Uniform generation of random regular graphs
- Fast uniform generation of random graphs with given degree sequences
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Sampling Random Graphs with Specified Degree Sequences
- Sequential stub matching for asymptotically uniform generation of directed graphs with a given degree sequence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853680)
