Disciplina Algoritmos em Grafos

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

Which of the following alternatives contains a false statement regarding network flow? a) The residual network is obtained by subtracting the flow’s edge weights from their corresponding edges in the original network. b) Residual networks obtained from maximum flows have no augmenting path. c) To push flow into an edge, the original vertex needs to have excess flow and the same height as the destination vertex. d) The sum of the weights of all edges of a single vertex in a flow is always zero, except for the source and the sink. e) None of the above. Original idea by: Pedro Zaffalon da Silva

Which of the following alternatives contains a graph with only one Strongly Connected Component (SCC)?  a) b) c)  d)   e) None of the above Original idea by: Pedro Zaffalon da Silva  

A BFS was performed on an unknown graph, producing the following visitation order: a-c-d-b-f-g-e-h There are four candidate graphs: I) II) III) IV)  Assuming that neighbors are always visited in  ascending order , which of the graphs are valid candidates for the original graph? a) I and II b) I and III b) II and IV d)  III and IV e) None of the above Original idea by: Pedro Zaffalon da Silva