Efficient counting of degree sequences (Q1712538)
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 7004817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient counting of degree sequences |
scientific article; zbMATH DE number 7004817 |
Statements
Efficient counting of degree sequences (English)
0 references
22 January 2019
0 references
graphical partition
0 references
degree sequence
0 references
\(k\)-connected graph
0 references
enumeration
0 references
0 references
0 references
0 references
0.90217394
0 references
0.86487776
0 references
0 references
0.8526849
0 references
0.85093594
0 references
0 references
0 references
0.8487304
0 references
