3 ms·

I was surprised that Gruhn didn't include this in his list of problems where the NP-hardness is not that important in practice. I think the Ford-Fulkerson maxi

by mjd 2mo ago

I was surprised that Gruhn didn't include this in his list of problems where the NP-hardness is not that important in practice. I think the Ford-Fulkerson maximum flow algorithm may be another example.

JohnKemeny 2mo ago
Maximum flow isn't NP-hard, though. It can be solved in near-linear time.