Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

UGC-NET | UGC NET CS 2018 July – II | Question 81

E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :
(A) O (E∗f)
(B) O (E2 ∗f)
(C) O (E∗f2 )
(D) O (E2 ∗f2 )

Answer: (A)
Explanation:
Quiz of this Question

Article Tags :
UGC-NET
Recommended Articles
1. UGC-NET | UGC NET CS 2018 July - II | Question 95
2. UGC-NET | UGC NET CS 2018 July - II | Question 47
3. UGC-NET | UGC NET CS 2018 July - II | Question 48
4. UGC-NET | UGC NET CS 2018 July - II | Question 49
5. UGC-NET | UGC NET CS 2018 July - II | Question 55
6. UGC-NET | UGC NET CS 2018 July - II | Question 40
7. UGC-NET | UGC NET CS 2018 July - II | Question 42
8. UGC-NET | UGC NET CS 2018 July - II | Question 43
9. UGC-NET | UGC NET CS 2018 July - II | Question 56
10. UGC-NET | UGC NET CS 2018 July - II | Question 60
11. UGC-NET | UGC NET CS 2018 July - II | Question 61
12. UGC-NET | UGC NET CS 2018 July - II | Question 62
13. UGC-NET | UGC NET CS 2018 July - II | Question 63
14. UGC-NET | UGC NET CS 2018 July - II | Question 64
15. UGC-NET | UGC NET CS 2018 July - II | Question 65
16. UGC-NET | UGC NET CS 2018 July - II | Question 66
17. UGC-NET | UGC NET CS 2018 July - II | Question 67
18. UGC-NET | UGC NET CS 2018 July - II | Question 68
19. UGC-NET | UGC NET CS 2018 July - II | Question 69
20. UGC-NET | UGC NET CS 2018 July - II | Question 71
21. UGC-NET | UGC NET CS 2018 July - II | Question 57
22. UGC-NET | UGC NET CS 2018 July - II | Question 59
23. UGC-NET | UGC NET CS 2018 July - II | Question 98
24. UGC-NET | UGC NET CS 2018 July - II | Question 50
25. UGC-NET | UGC NET CS 2018 July - II | Question 8