Showing papers on "Longest path problem published in 1969"

Path Length Computations on Graph Models of Computations

Abstract: This paper discusses essential difficulties in calculating mean path lengths on a directed graph model of computations. This study was part of a larger study of a priori scheduling of computer programs in a parallel processing environment. Efficient approximations to mean processing time (mean path length) of programs in such an environment are given.