Efficient graph algorithms for sequential and parallel computers. Doctoral thesis

Technical Report · Sun Feb 01 00:00:00 EST 1987

OSTI ID:6488035

Goldberg, A V

This thesis studies graph algorithms, both in sequential and parallel contexts. In the outline of the thesis, algorithm complexities are stated in terms of the the number of vertices n, the number of edges m, the largest absolute value of capacities U, and the largest absolute value of costs C. Chapter 1 introduces a new approach to the maximum flow problem that leads to better algorithms for the problem. Chapter 2 is devoted to the minimum cost flow problem, which is a generalization of the maximum flow problem. Chapter 3 addresses implementation of parallel algorithms through a case study of an implementation of a parallel maximum flow algorithm. Parallel prefix operations play an important role in the implementation. Present experimental results achieved by the implementation are presented. Present parallel symmetry-breaking techniques are the main topic of Chapter 4.

• Research Organization: Massachusetts Inst. of Tech., Cambridge (USA). Lab. for Computer Science
• OSTI ID: 6488035
• Report Number(s): AD-A-178403/2/XAB; MIT/LCS/TR-374
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
COMPUTER GRAPHICS
PARALLEL PROCESSING
ALGORITHMS
COST
EFFICIENCY
GRAPHS
MATHEMATICAL LOGIC
PROGRAMMING
990210* - Supercomputers- (1987-1989)