Timeline for Ford-Fulkerson vs Edmonds-Karp
Current License: CC BY-SA 4.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 9, 2019 at 18:12 | vote | accept | Optidad | ||
May 9, 2019 at 17:03 | comment | added | j_random_hacker | @dkaeae: You can even do this on a single CPU: run a step of one, then a step of the other. My guess is that it's not done because it's empirically rare for a DFS-based FF to be materially faster than EK, and in the cases where it's not, you (at best) double the time to find a solution. | |
May 9, 2019 at 16:57 | answer | added | j_random_hacker | timeline score: 8 | |
May 9, 2019 at 15:12 | comment | added | dkaeae | In a world where parallel computers are ubiquitous, it would not be unthinkable to run both algorithms in parallel and take the answer of the one which answers first. | |
May 9, 2019 at 14:46 | history | asked | Optidad | CC BY-SA 4.0 |