Question 7 - Network Flow

Consider the flow network below with flow f and capacity c in f / c format, with node 0 as the source and node 5 as the sink. It is correct to state that:


A.  The maximum flow is 18.

B. There are no augmenting paths. 

C. In the residual network there is only one augmenting path, in the following nodes: 0 -> 1 -> 4 -> 5.

D. The maximum flow is 27, obtained after increasing the flow in two augmenting paths, 0 -> 1 -> 4 -> 5 and 0 -> 2 -> 5, by 3 and 6 units, respectively.  

E. None of the above. 


Original idea by: Vitoria D. M. Pinho 

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Question 4 - The Barabási-Albert Model

Imagem
Consider the following graph. According to the Linearized Chord Diagram, what are the probabilities that a new node is added to each of the nodes? Consider the normalization constant as 13. A. N1: p =  1/25, N2: p = 4/25, N3: p = 3/25, N4: p = 2/25, N5: p = 1/25, N6: p = 1/25 B. N1: p =  1/13, N2: p = 4/13, N3: p = 3/13, N4: p = 2/13, N5: p = 1/13, , N6: p = 1/13 C.  N1: p =  1/25, N2: p = 4/13, N3: p = 3/13, N4: p = 2/13, N5: p = 1/25, N6: p = 1/25 D. N1: p =  1/3, N2: p = 4/9, N3: p = 3/7, N4: p = 2/5, N5: p = 1/3, N6: p = 1/3 E. None of the above.  Original idea by: Vitoria D. M. Pinho 
Leia mais

Question 5 - Envolving Networks

 Choose the correct alternative about evolving network models:  A. In the Bianconi-Barabási Model, the preferential attachment is proportional to the node's degree and fitness property, which is the probability of generating new internal links between pre-existing nodes. B. In the Initial Attractiveness Model, the preferential attachment is proportional to the product of the node degree and a constant A, called initial attractiveness.  C. In the Accelerated Growth Model, for any θ value, the network is always scale-free. D. In the Aging Model, the preferential attachment depends on a v parameter. A positive ν means that new nodes are more likely to connect to younger nodes, while a negative v means that new nodes are more likely to connect to older nodes. E. None of the above.  Original idea by: Vitoria D. M. Pinho 
Leia mais