×

zbMATH — the first resource for mathematics

Complexity of the minimum-dummy-activities problem in a Pert network. (English) Zbl 0414.68018

MSC:
68Q25 Analysis of algorithms and problem complexity
94C15 Applications of graph theory to circuits and networks
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] , and , The design and analysis of computer algorithms, Addison-wesley, Mass., 1974.
[2] Corneil, Comm. ACM 16 pp 296– (1973)
[3] Graph Theory with Applications to Computer Science and Engineering, Prentice-Hall, N.J. 1974.
[4] Dimsdale, IBM Systems Journal 2 pp 24– (1963)
[5] Fisher, Comm. ACM 11 pp 493– (1968)
[6] , and , ”Some simplified polnomial complete problems”, Proc. of Sixth Annual ACM Symp. on Theory of Computing, 1974, 47–64.
[7] Graph Theory, Addison-Wesley, Mass., 1969.
[8] Karp, Networks 5 pp 45– (1975)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.