Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2009.01.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2009.01.001 / rank | |||
Normal rank | |||
Latest revision as of 14:40, 10 December 2024
scientific article
| 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 |
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
