Optimal stopping in a search for a vertex with full degree in a random graph (Q765377)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal stopping in a search for a vertex with full degree in a random graph |
scientific article; zbMATH DE number 6015815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal stopping in a search for a vertex with full degree in a random graph |
scientific article; zbMATH DE number 6015815 |
Statements
Optimal stopping in a search for a vertex with full degree in a random graph (English)
0 references
19 March 2012
0 references
random graph
0 references
vertex with full degree
0 references
optimal stopping
0 references
0.828495442867279
0 references
0.7947307229042053
0 references
0.7933059930801392
0 references
0.7827681303024292
0 references
0.7762067914009094
0 references
