Syslo, Maciej M. Optimal constructions of event-node networks. (English) Zbl 0464.90078 RAIRO, Rech. Opér. 15, 241-260 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 2 Documents MSC: 90C35 Programming involving graphs or networks 68R10 Graph theory (including graph drawing) in computer science 05C35 Extremal problems in graph theory 68Q25 Analysis of algorithms and problem complexity 05C20 Directed graphs (digraphs), tournaments Keywords:event-node networks; project network; activity networks; event networks; dummy activities; approximate algorithm; line digraph; network construction; polynomial time algorithm; network analysis PDF BibTeX XML Cite \textit{M. M. Syslo}, RAIRO, Rech. Opér. 15, 241--260 (1981; Zbl 0464.90078) Full Text: DOI EuDML OpenURL