The Edmonds-Karp algorithm is a specific implementation of the Ford-Fulkerson method that uses which search strategy?

Breadth-First Search (BFS)

By specifically using BFS to find the shortest augmenting path (in terms of number of edges), Edmonds-Karp guarantees a termination time of O(V E^2), regardless of edge capacities.