An algorithm for seeking the critical paths in the overall planning graph

An algorithm for seeking the critical paths in the overall planning graph

0.00 Avg rating0 Votes
Article ID: iaor20021141
Country: China
Volume: 37
Issue: 5
Start Page Number: 683
End Page Number: 687
Publication Date: Oct 2000
Journal: Journal of Sichuan University
Authors: ,
Keywords: planning, networks: scheduling
Abstract:

An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O(n3). The theory, which the algorithm depends on, is verified in detail.

Reviews

Required fields are marked *. Your email address will not be published.