Sampling \(k\)-partite graphs with a given degree sequence (Q2326166)
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: Sampling k-partite graphs with a given degree sequence |
scientific article; zbMATH DE number 7113833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sampling \(k\)-partite graphs with a given degree sequence |
scientific article; zbMATH DE number 7113833 |
Statements
Sampling \(k\)-partite graphs with a given degree sequence (English)
0 references
7 October 2019
0 references
degree sequence
0 references
contraction of a degree sequence
0 references
degree sequence bipartition
0 references
contraction of a graph
0 references
deletion of a graph
0 references
ecological occurrence matrix
0 references
0 references
0 references
0.8719120621681213
0 references
0.8129333257675171
0 references
0.7933500409126282
0 references
0.7905118465423584
0 references
0.7901550531387329
0 references
