article · 1983

Parallel processing for some network optimization problems

Cited by 6Abstract and details only

Abstract

Parallel processing is a new area of computer science which has evolved in the recent years. Development of parallel computers has increased interest in the study of parallel algorithms. The importance of parallel algorithms lies in the fact that the widespread use of parallel computers depends on the availability of efficient parallel algorithms. There are a large number of parallel algorithms for numerical problems, but parallel algorithms for nonnumerical problems are rare. In this dissertation some techniques and data structures to exploit parallelism are categorized. Parallel algorithms are designed for the following problems: minimum spanning tree, one-to-all shortest path, maximum flow, and minimum cost flow. Most of the parallel algorithms have been implemented on an actual parallel computer and/or a parallel computer simulator. ('+)This work was partially supported by U.S. Army Research Office grant number DAAG-82-K-0107 and National Science Foundation equipment grant number MCS-8203868.

Cite this paper

APA 7

Yoo, Y. B. (1983). Parallel processing for some network optimization problems.

MLA 9

Yoo, Year Back. “Parallel processing for some network optimization problems.” 1983.

Chicago

Yoo, Year Back. 1983. “Parallel processing for some network optimization problems.”

Harvard

Yoo, Y.B. (1983) ‘Parallel processing for some network optimization problems’.

BibTeX

@article{yoo1983parallel,
  title = {{Parallel processing for some network optimization problems}},
  author = {Yoo, Year Back},
  year = {1983}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.