The random graph threshold for \(k\)-orientiability and a fast algorithm for optimal multiple-choice allocation (Q2934628)
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 6381674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The random graph threshold for \(k\)-orientiability and a fast algorithm for optimal multiple-choice allocation |
scientific article; zbMATH DE number 6381674 |
Statements
18 December 2014
0 references
0.888152539730072
0 references
0.8346104025840759
0 references
0.8237324953079224
0 references
0.8191333413124084
0 references
0.818591833114624
0 references
