Skip to main navigation menu Skip to main content Skip to site footer

TRANSFORMATION OF GRAPHS WHEN CALCULATING CHARACTERISTICS IN PERT NETWORKS

PDF

Abstract

PERT (Program Evaluation Review Technique) [1] is a network that graphically represents the chronology of the project and allows to manage the project by breaking it down into separate tasks for evaluation and analysis of work execution terms.


References

  1. Harvey M. Sapolsky. The Polaris System Development: Bureaucratic and Programmatic Success in Government. – 1972. – 261 p.
  2. Micha Sharir. A strong-connectivity algorithm and its applications in data flow analysis. Computers & Mathematics with Applications. – №7. – 1981. – P. 67-72.
  3. Robert E. Tarjan. Depth-first search and linear graph algorithms. – 1972. – P. 146-160.
  4. Edsger Dijkstra. A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall. – 1976. – 217 p.

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Copyright (c) 2023 Anastasiia Markova , Valentina Turchyna