The Edmonds-Karp Algorithm is an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network, using breadth-first search to find augmenting paths. It guarantees polynomial time complexity of O(VE^2) by ensuring the shortest path in terms of the number of edges is always chosen, preventing cycles and infinite loops.