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 this page instead for the normal view: Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem |
scientific article; zbMATH DE number 6382947
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
