Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem (Q482492)
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 6382947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem |
scientific article; zbMATH DE number 6382947 |
Statements
Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem (English)
0 references
30 December 2014
0 references
spanning trees of graphics
0 references
vertex cover
0 references
ratio
0 references
secretary problem
0 references
social interaction
0 references
network communication
0 references
convergence asymptotes
0 references
constant \(1/e\) as convergent solution of differential equations
0 references
areas
0 references
0.7066178321838379
0 references
0.7064951062202454
0 references
0.6729720830917358
0 references
0.6665374040603638
0 references
0.6562348008155823
0 references
