Optimal constructions of event-node networks
RAIRO - Operations Research - Recherche Opérationnelle, Volume 15 (1981) no. 3, pp. 241-260.
@article{RO_1981__15_3_241_0,
     author = {Syslo, Maciej M.},
     title = {Optimal constructions of event-node networks},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {241--260},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {3},
     year = {1981},
     mrnumber = {637195},
     zbl = {0464.90078},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1981__15_3_241_0/}
}
TY  - JOUR
AU  - Syslo, Maciej M.
TI  - Optimal constructions of event-node networks
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1981
SP  - 241
EP  - 260
VL  - 15
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1981__15_3_241_0/
LA  - en
ID  - RO_1981__15_3_241_0
ER  - 
%0 Journal Article
%A Syslo, Maciej M.
%T Optimal constructions of event-node networks
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1981
%P 241-260
%V 15
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1981__15_3_241_0/
%G en
%F RO_1981__15_3_241_0
Syslo, Maciej M. Optimal constructions of event-node networks. RAIRO - Operations Research - Recherche Opérationnelle, Volume 15 (1981) no. 3, pp. 241-260. http://archive.numdam.org/item/RO_1981__15_3_241_0/

1. A. V. Aho, M. R. Garey and J. D. Ullman, The Transitive Reduction of a Directed Graph, S.I.A.M. J. Comput, Vol. 1, 1972, pp. 131-137. | MR | Zbl

2. D. G. Cantor and B. Dimsdale, On Direction-Preserving Maps of Graphs,J. Combinatorial Theory, Vol. 6, 1969, pp. 165-176. | MR | Zbl

3. D. G. Corneil, C. C. Gotlieb and Y. M. Lee, Minimal Event-Node Network of Project Precedence Relations, Comm. A.C.M. Vol. 16. 1973, pp. 296-298. | Zbl

4. B. Dimsdale, Computer Construction of Minimal Project Networks, I.B.M. Syst. J., Vol. 2, 1963, pp. 24-36.

5. A. C. Fisher, J. S. Liebman and G. L. Nemhauser, Computer Construction of Project Networks, Comm, A.C.M., Vol. 11, 1968, pp. 493-497. | Zbl

6. F. Harary and Z. R. Norman, Some Properties of Line Digraphs, Rend. Circ. Mat. Palermo, Vol. 9, 1960, pp. 161-168. | MR | Zbl

7. F. Harary, Graph Theory, Addison-Wesley, Mass., 1969. | MR | Zbl

8. M. Hayes, The Role of Activity Precedence Relationships in Node-Oriented Networks, in : Project Planning by Network Analysis, Proccedings of the Second International Congress, North-Holland Pub. Comp., Amterdam, 1969, pp. 128-146.

9. M. S. Krishnamoorthy and N. Deo, Complexity of the Minimum-Dummy-Activities Problem in a PERT Network, Networks, Vol. 9, 1969, pp. 189-194. | MR | Zbl

10. Y. M. Lee, The Minimal Event-Node Network of Project Precedence Relations, M. Sc. Thesis, University of Toronto, Canada, 1971. | Zbl

11. F. Sterboul and D. Wertheimer, Comment construire un graphe PERT minimal, Université des Sciences et Techniques de Lille, January 1979. | Numdam | MR | Zbl

12. M. M. Syslo, Remarks on Line Digraphs, Bull. Acad. Polon. Sc, Ser. Sc. Math.Astronom. Phys., Vol. 22, 1974, pp. 5-10. | MR | Zbl

13. M. M. Syslo, Optimal Constructions of Reversible digraphs, Technical Report Nr. N-55, Institute of Computer Science University of Wroclaw, Wroclaw, May 1979. | Zbl