Question 1 : What is the minimum number of cuts that a graph with 'n' vertices can have?
1. n+1
2. n(n-1)
3. n(n+1)/2
4. n(n-1)/2
View Answer   Discuss with Members

Question 2 : Which one of the following is not an application of max-flow min-cut algorithm?
1. network reliability
2. closest pair
3. network connectivity
4. bipartite matching
View Answer   Discuss with Members

Question 3 : Which algorithm is used to solve a minimum cut algorithm?
1. Gale-Shapley algorithm
2. Ford-Fulkerson algorithm
3. Stoer-Wagner algorithm
4. Prim's algorithm
View Answer   Discuss with Members

Question 4 : ______________ separates a particular pair of vertices in a graph.
1. line
2. arc
3. cut
4. flow
View Answer   Discuss with Members

Question 5 : The weight of the cut is not equal to the maximum flow in a network.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 6 : The running time of implementing naïve solution to min-cut problem is?
1. O(N)
2. O(N log N)
3. O(log N)
4. O(N²)
View Answer   Discuss with Members

Question 7 : ___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.
1. Minimum cut
2. Maximum flow
3. Maximum cut
4. Graph cut
View Answer   Discuss with Members

Question 8 : What is the running time of implementing a min-cut algorithm using bidirected edges in a graph?
1. O(N)
2. O(N log N)
3. O(N⁴)
4. O(N²)
View Answer   Discuss with Members

Question 9 : __________ is a data structure used to collect a system of cuts for solving min-cut problem.
1. Gomory-Hu tree
2. Gomory-Hu graph
3. Dancing tree
4. AA tree
View Answer   Discuss with Members

Question 10 : In how many ways can a Gomory-Hu tree be implemented?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members