Welcome on Board!

Hey There, this Blog was created to upload exercicies of Network Science Class - MO412A 1s2023.

Campinas, São Paulo, Brazil.  

Arthur Hendricks :)

Comments

Post a Comment

Popular posts from this blog

Networks and Graphs - Bipartite Networks

Consider the following examples of Bipartite Networks: I - In the iFood Delivery Network, a set of nodes corresponding to Motorcycle Couries (U) and the other to Customers (V). II - In the Gmail Spam Network, a set of nodes corresponding to E-mails (U) and the other to Spam List (V). III - In the Spotify Playlist Network, a set of nodes corresponding to Playlists (U) and the other to Musics (V). IV - In the LinkedIn Job Opportunities Network, a set of nodes corresponding to Recruiters (U) and the other to Employment Opportunities (V). The only affirmations above that are  false  are: A) III and IV  B) II and IV C) I and III D) Only II E) None of the above Original idea by: Arthur Hendricks.
Read more

Network Flow

Which of the following statements is true when comparing the Ford-Fulkerson algorithm and the Push-Relabel algorithm for solving maximum flow problems in networks? A) The Ford-Fulkerson algorithm is a specific implementation of the  Push-Relabel algorithm . B)  The Ford-Fulkerson algorithm always terminates in polynomial time for any network . C)  The Push-Relabel algorithm  is a more efficient and faster alternative to the Ford-Fulkerson algorithm.  D) Both t he Ford-Fulkerson and Push-Relabel algorithms can find the maximum flow in a network, but the Push-Relabel algorithm garantees a shorter runtime. E) None of the above. Original idea by: Arthur Hendricks.
Read more

Network Science: Strongly Connected Components

Which of the following statements is true about the Kosaraju-Sharir's algorithm?  A) It is used to find the shortest path between two nodes in a graph. B) It is a greedy algorithm that always finds the optimal solution. C) It is used to determining the strongly connected components in a directed graph. D) It is used to computing the minimum spanning tree of a graph E) None of the above. Original idea by: Arthur Hendricks.
Read more