English Edmonds–Karp algorithm Cited by user Bjturedwind on 16 Nov 2020 In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in
English Promise problem Cited by user Ott2 on 20 May 2013 In computational complexity theory, a promise problem is a generalization of a decision problem where the input is promised to belong to a subset of all possible inputs.