APPLYING PARALLEL COMPUTATION ALGORITHMS IN THE DESIGN OF SERIAL ALGORITHMS

[1] Aho A., 1976, DESIGN ANAL COMPUTER

[2] [Anonymous], 1970, SOVIET MATH DOKL

[3] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING [J]. JOURNAL OF THE ACM, 1982, 29 (01) : 58 - 67

[4] Berge C., 1965, PROGRAMMING GAMES TR

[5] BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[6] MINIMAL RATIO SPANNING TREES [J]. NETWORKS, 1977, 7 (04) : 335 - 342

[7] LOCATION ON TREE NETWORKS - P-CENTRE AND N-DISPERSION PROBLEMS [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) : 50 - 57

[8] CHANDRASEKARAN R, 1978, 357 NW U CTR MATH ST

[9] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[10] Coffman E.G., 1976, COMPUTER JOB SHOP SC

[1] Aho A., 1976, DESIGN ANAL COMPUTER

[2] [Anonymous], 1970, SOVIET MATH DOKL

[3] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING [J]. JOURNAL OF THE ACM, 1982, 29 (01) : 58 - 67

[4] Berge C., 1965, PROGRAMMING GAMES TR

[5] BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[6] MINIMAL RATIO SPANNING TREES [J]. NETWORKS, 1977, 7 (04) : 335 - 342

[7] LOCATION ON TREE NETWORKS - P-CENTRE AND N-DISPERSION PROBLEMS [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) : 50 - 57

[8] CHANDRASEKARAN R, 1978, 357 NW U CTR MATH ST

[9] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[10] Coffman E.G., 1976, COMPUTER JOB SHOP SC