Distributed algorithm for analysing activity networks

Pranay Chaudhuri · International Journal of Electronics · 1986

An algorithm for computing early start time, late start time and slack time, for each activity of an activity network on a distributed computation model, is proposed. Computational complexity and proof of correctness of the distributed algorithm are also given.

Read the paper · More papers on PaperTik