Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics (Q4979844)
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: Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics |
scientific article; zbMATH DE number 6305457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics |
scientific article; zbMATH DE number 6305457 |
Statements
Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics (English)
0 references
19 June 2014
0 references
asymptotic expansion
0 references
random graphs
0 references
graph algorithms
0 references
generating functions
0 references
Laplace transform
0 references
saddle-point method
0 references
pantograph equation
0 references
0 references
0.88594514
0 references
0.87763953
0 references
0.87565285
0 references
0.8691649
0 references
0.86867553
0 references
0.8671473
0 references
