Disciplina Algoritmos em Grafos

  Considering that ties are decided in alphabetical order, select the alternative with the correct heuristic and the initial state used to obtain the following Traveling Salesperson Problem solution: A. Closest neighbor, starting at vertex  a . B. Cheapest insertion, starting with a cycle with vertices  a, b and c . C.  Closest neighbor, starting at vertex  b . D. Farthest insertion,  starting with a cycle with vertices  a, b  and  c . E. None of the above. Original idea by: Pedro Zaffalon.  

Which of the following statements about degree correlations is true: A. In n eutral networks, hubs tend to link with low degrees nodes. B. In  assortative networks, e ⱼₖ tends to be lower for similar values of j and k . C. In disassortative networks, the average degree of the nearest  neighbors is inversely proportional to  a node’s degree. D. In perfectly assortative  networks,  nodes connect to each  other with the expected  random probabilities. E.  None of the above. Original idea by: Pedro Zaffalon.   k n n k n n k n n k n n k n n