A compact hash function for paths in PERT networks (Q797503): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Calculating bounds on reachability and connectedness in stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating critical path and arc probabilities in stochastic activity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic PERT / rank
 
Normal rank
Property / cites work
 
Property / cites work: GERT networks and the time-oriented evaluation of projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stochastic Shortest Route Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120588 / rank
 
Normal rank

Latest revision as of 12:37, 14 June 2024

scientific article
Language Label Description Also known as
English
A compact hash function for paths in PERT networks
scientific article

    Statements

    A compact hash function for paths in PERT networks (English)
    0 references
    1984
    0 references
    PERT networks
    0 references
    directed acyclic network
    0 references
    one source
    0 references
    one sink
    0 references
    hash function
    0 references
    stochastic networks
    0 references

    Identifiers

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