Raphael - MO412 A

Solve the Travel Salesperson Problem for the following undirected weighted graph and pick the best answer: A) Path ABCDEA and length 24 B) Path ABCEDA and length 20 C) Path ADEBCA and length 18 D) Path AEBCDA and length 19 E) None of the above Original question by: Raphael Adamski Original images from https://graphicmaths.com/computer-science/graph-theory/travelling-salesman-problem/

  Consider a undirected graph where  nodes connect to each  other with the expected  random probabilities. Given N = 10 000, L= 100 000, ⟨k⟩ = 89,  ⟨k²⟩ =  ⟨k⟩* 2,  Calculate the Degree Correlation Function: A.  k nn (k) = 178/k , and it behaves like a neutral network B.  k nn (k) = 89k^(2), and it behaves like an  Assortative Network C. k nn (k) = 178/k , and it behaves like  an  Assortative Network D.  k nn (k) = 89k^(-2), and it behaves like a  Disassortative Network E. None of the above Original idea by: Raphael Adamski

   S olve the maximum flow problem for the following network. E ach label   f e / c e  denotes both the flow  f e  pushed through an edge  e  and the capacity  c e  of this edge Evaluate (Correct/Wrong) each option: I. This is the residual network after finding the maximum flow: II. This is the network after finding the maximum flow: III. This is the network after finding the maximum flow:      Considering Correct as True and Wrong as False, pick the correct letter respectively: A. True, False, False B.  False, True, False C. True , True, False D.  True , False, True E. None of the above Original idea by: Raphael Adamski G