User contributions for 2401:FA00:8F:201:B5E5:30EE:9390:F22F
Appearance
Results for 2401:FA00:8F:201:B5E5:30EE:9390:F22F talk block log logs global block log filter log
1 March 2023
- 06:3306:33, 1 March 2023 diff hist +1 Maximum flow problem →Algorithms: Ope, <math>f</math> is bounded by <math>EU<math>. I wasn't considering duplicate edges.
- 06:2106:21, 1 March 2023 diff hist −1 Maximum flow problem →Algorithms: The Ford-Fulkerson algorithm's time complexity is <math>O(Ef)</math> where <math>f</math> is the maximum flow of the network. <math>f</math> is bounded by <math>VU</math>, so the time complexity is <math>O(VEU)</math>, not <math>O(EU)</math>. Source: Ford-Fulkerson algo: <ref>https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm#cite_note-4</ref>