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.
Date of last update: October 30, 1994.