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.

Comments

Post a Comment

Popular posts from this blog

Network Science: Network Robustness

  Which of the following statements correctly describes the robustness of scale-free networks? A) Scalle-free networks are highly robust against targeted attacks but vulnerable to random node removal. B) Scalle-free networks are equally robust against random node removal and targeted attacks. C) Scalle-free networks are highly robust against random node removal but vulnerable to targeted attacks. D) Scalle-free networks are vulnerable to both random node removal and targeted attacks. 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