Network Flow
Which of the following statements is true when comparing the Ford-Fulkerson algorithm and the Push-Relabel algorithm for solving maximum flow problems in networks? A) The Ford-Fulkerson algorithm is a specific implementation of the Push-Relabel algorithm . B) The Ford-Fulkerson algorithm always terminates in polynomial time for any network . C) The Push-Relabel algorithm is a more efficient and faster alternative to the Ford-Fulkerson algorithm. D) Both t he Ford-Fulkerson and Push-Relabel algorithms can find the maximum flow in a network, but the Push-Relabel algorithm garantees a shorter runtime. E) None of the above. Original idea by: Arthur Hendricks.