Parallel algorithms in combinatorial optimization: an annotated bibliography
暂无分享,去创建一个
[1] K. Mani Chandy,et al. Distributed computation on graphs: shortest path algorithms , 1982, CACM.
[2] John Staples,et al. The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..
[3] Basile Kamdoum. Speeding up the primal simplex algorithm on parallel computer , 1982, SMAP.
[4] Uzi Vishkin,et al. An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.
[5] Sartaj Sahni,et al. Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..
[6] Wing H. Huen,et al. Distributed Enumeration on Between Computers , 1980, IEEE Transactions on Computers.
[7] D. Al-Dabass. Two methods for the solution of the dynamic programming algorithm on a multiprocessor cluster , 1980 .
[8] David E. Muller,et al. Restructuring of Arithmetic Expressions For Parallel Evaluation , 1976, JACM.
[9] Shmuel Winograd,et al. On the Parallel Evaluation of Certain Arithmetic Expressions , 1975, JACM.
[10] David J. Kuck,et al. Time Bounds on the Parallel Evaluation of Arithmetic Expressions , 1975, SIAM J. Comput..
[11] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.
[12] R. Larson,et al. Dynamic programming and parallel computers , 1973 .
[13] Kiyoshi Maruyama,et al. The Parallel Evaluation of Arithmetic Expressions Without Division , 1973, IEEE Transactions on Computers.
[14] Kiyoshi M. Maruyama,et al. On the Parallel Evaluation of Polynomials , 1973, IEEE Transactions on Computers.