Sampling \(k\)-partite graphs with a given degree sequence (Q2326166): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128631787, #quickstatements; #temporary_batch_1728564459526 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128631787 / rank | |||
Normal rank | |||
Latest revision as of 14:22, 10 October 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
0 references
0 references
