TP301.6
Based on multiprocessor Mpscu, two parallel algorithms are proposed to solve the shortest path problems in N vertex graph within time O(N3/k)with K processors.
周六丁 程代杰.求所有点对最短路径的两个MIMD并行算法[J].重庆大学学报,1991,14(1):91~94
