Counting and selecting at random bipartite graphs with fixed degrees (Q3495378)
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 4168707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and selecting at random bipartite graphs with fixed degrees |
scientific article; zbMATH DE number 4168707 |
Statements
Counting and selecting at random bipartite graphs with fixed degrees (English)
0 references
1990
0 references
(0,1)-matrices
0 references
0.8608635067939758
0 references
0.8203577399253845
0 references
0.8078033924102783
0 references
0.7963148951530457
0 references
0.7927634716033936
0 references
