A compact hash function for paths in PERT networks

DOI10.1016/0167-6377(84)90005-1MaRDI QIDQ797503zbMATH OpenOpenAlexFDO

Authors Vidyadhar G. Kulkarni

Publication date 1984

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(84)90005-1

zbMATH Keywords

stochastic networkshash functionPERT networksdirected acyclic networkone sinkone source

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 637315
• Minimal perfect hashing in polynomial time
• Hash functions and Cayley graphs
• scientific article; zbMATH DE number 177615
• A new practical algorithm for the construction of a perfect hash function

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3545680 (Why is no real title available?)
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• Calculating bounds on reachability and connectedness in stochastic networks
• Estimating critical path and arc probabilities in stochastic activity networks
• GERT networks and the time-oriented evaluation of projects
• Probabilistic PERT
• The Stochastic Shortest Route Problem

This page was built for publication: A compact hash function for paths in PERT networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797503)