Sampling \(k\)-partite graphs with a given degree sequence (Q2326166): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:08, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sampling \(k\)-partite graphs with a given degree sequence |
scientific article |
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
