Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026)
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: Approximating the longest path length of a stochastic DAG by a normal distribution in linear time |
scientific article; zbMATH DE number 5645006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the longest path length of a stochastic DAG by a normal distribution in linear time |
scientific article; zbMATH DE number 5645006 |
Statements
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (English)
0 references
10 December 2009
0 references
directed acyclic graph
0 references
longest path problem
0 references
stochastic edge weight
0 references
normal distribution
0 references
approximation
0 references
0.9375591
0 references
0.89733636
0 references
0.88190067
0 references
0.8689561
0 references
0.8644909
0 references
0.85624325
0 references
0.8504456
0 references
0.8494014
0 references
