Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4845373 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Greatest of a Finite Set of Random Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2744679 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Application of a Technique for Research and Development Program Evaluation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distribution of the Time Through a Directed, Acyclic Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4856179 / rank | |||
Normal rank | |||
Revision as of 06:26, 2 July 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
