
                              Lecture 14
                              10/27/1994

		    Graph Algorithms Implementation

		 Prof. Steve Homer and Marcus Peinado
			    Guest lecturers


Implementation details and results of implementing graph algorithms
(finding the maximum clique in a graph, and finding the maximum cut in
a graph) on the CM-5 will be discussed, including how to partition the
problem to reduce communication overhead. The scalability of these
implementations will be analyzed.

This document has been prepared by Professor Azer Bestavros <best@cs.bu.edu> as the WWW Home Page for CS-551, which is part of the NSF-funded undergraduate curriculum on parallel computing at BU.

Date of last update: October 30, 1994.