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 the normal view instead:
scientific article; zbMATH DE number 6547955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8478763699531555
0 references
0.8374537825584412
0 references
0.8279097080230713
0 references
0.8081696033477783
0 references
0.8063958287239075
0 references
