Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026)

From MaRDI portal
Revision as of 14:40, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references