Felipe Crispim

Considering the definitions of Network Flow , please select the INCORRECT affirmation below: A.  There are two types of special nodes, Source and Sink. B. The flow-conservation property says that the total flow  into a node other than the source or sink must equal the total flow out of that  node (flow in equals flow out). C. Between two nodes ( A and B ), links flowing in opposite directions (antiparallel edges) are allowed ( A to B , and B to A ). D. Multiple edges (Parallel edges, i.e., same directions) between two nodes are allowed (Same start and end nodes). E. None of the above. Original idea by: Felipe Crispim da Rocha Salvagnini

Suppose you start analysing the evolution of a real-network that you are interested in. When studying its growth, you identify that it can be mapped as a copying model . The current state of the network has 2018 nodes and 2930 links, and a new node has a probability of 0.137 to select randomly a target node u . What are the preferential attachment values for this new node to connect with nodes of degree 13 and 21 ( Rounding to Three Decimal Places )? A. Π(13) : 0.003, Π(21) : 0.005 B.  Π(13) : 0.002, Π(21) : 0.003 C.  Π(13) : 0.002, Π(21) : 0.004 D.  Π(13) : 0.003, Π(21) : 0.001 E. None of the above. Original idea by: Felipe Crispim da Rocha Salvagnini

 Given the following reverse graph below, alongside its reverse order of finishing times (DFS starting at node 1), please, identify the number of strongly connected components in the original graph, using the Kosaraju-Sharir’s algorithm: A. 3 B. 4 C.  2 D.  5 E. None of the above. Original idea by: Felipe Crispim da Rocha Salvagnini