Speaker: Joey Santos
Candidate for Bachelor of Arts in Computer Information Science
Time: 4:40 PM
Place: Trustee Hall 211
Supervisor: Dr. James McGuffee
Title: The Maximum Flow Problem – Implementing the Ford-Fulkerson and Edmonds-Karp Algorithms

Abstract: The maximum flow problem asks the question, “What is the greatest rate at which material can be shipped from the source to the sink without violating any capacity constraints?” The two main solutions to the problem are the Ford-Fulkerson algorithm and the Edmonds-Karp algorithm. The Edmonds-Karp algorithm is an improvement to the Ford-Fulkerson algorithm. It uses a breadth-first search instead of a depth-first search. The two algorithms were tested using the programming language C and the results were compared to show if the improved algorithm performed faster than the initial algorithm. The results showed that the Edmonds-Karp algorithm performed faster than the Ford-Fulkerson algorithm.