A linear-time algorithm for sampling graphs with given degrees (Q2789573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear-time algorithm for sampling graphs with given degrees |
scientific article; zbMATH DE number 6547955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for sampling graphs with given degrees |
scientific article; zbMATH DE number 6547955 |
Statements
1 March 2016
0 references
uniform sampling
0 references
graphs with given degrees
0 references
perfect matching
0 references
Markov chain coupling
0 references
A linear-time algorithm for sampling graphs with given degrees (English)
0 references
