Free Access
RAIRO-Oper. Res.
Volume 15, Number 3, 1981
Page(s) 241 - 260
Published online 06 February 2017
  • 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: 306032] [Zbl: 0247.05128] [Google Scholar]
  • 2. D. G. CANTOR and B. DIMSDALE, On Direction-Preserving Maps of Graphs,J. Combinatorial Theory, Vol. 6, 1969, pp. 165-176. [MR: 237385] [Zbl: 0181.51902] [Google Scholar]
  • 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: 0271.94022] [Google Scholar]
  • 4. B. DIMSDALE, Computer Construction of Minimal Project Networks, I.B.M. Syst. J., Vol. 2, 1963, pp. 24-36. [Google Scholar]
  • 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: 0169.20301] [Google Scholar]
  • 6. F. HARARY and Z. R. NORMAN, Some Properties of Line Digraphs, Rend. Circ. Mat. Palermo, Vol. 9, 1960, pp. 161-168. [MR: 130839] [Zbl: 0099.18205] [Google Scholar]
  • 7. F. HARARY, Graph Theory, Addison-Wesley, Mass., 1969. [MR: 256911] [Zbl: 0182.57702] [Google Scholar]
  • 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. [Google Scholar]
  • 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: 546996] [Zbl: 0414.68018] [Google Scholar]
  • 10. Y. M. LEE, The Minimal Event-Node Network of Project Precedence Relations, M. Sc. Thesis, University of Toronto, Canada, 1971. [Zbl: 0271.94022] [Google Scholar]
  • 11. F. STERBOUL and D. WERTHEIMER, Comment construire un graphe PERT minimal, Université des Sciences et Techniques de Lille, January 1979. [MR: 597366] [Zbl: 0477.90028] [Google Scholar]
  • 12. M. M. SYSLO, Remarks on Line Digraphs, Bull. Acad. Polon. Sc, Ser. Sc. Math.Astronom. Phys., Vol. 22, 1974, pp. 5-10. [MR: 387111] [Zbl: 0273.05114] [Google Scholar]
  • 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: 0552.90047] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.