Introduction to Communities

 Choose the correct alternative about communities:


A) It is impossible to identify communities on social media networks based on the people's opinion;

B) Each member of a community in a network with N >= 1 must be reached through links connecting other members of the same community;

C) A strong community is a weak community with less nodes and edges;

D) The time spent to calculate a bisection graph partitioning is inversely proportional to the number of nodes of the network

E) None of the above.


Original idea by: André Regino

Comentários

  1. Joao Meidanis16 de junho de 2021 às 18:28

    Interesting question, but maybe too easy. For instance, it is not plausible that some algorithm will require time inversely proportional to graph size. I'll leave it out for now.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

The Orion Constellation

Imagem
 Orion was a great warrior of ancient times. It was so important in the Greek history that Zeus created a constellation illustrating him in a fight position. The constellation can be modeled as a graph, with its vertex representing the stars and the edges the links that shape the constellation. Based on the image and the statements below and considering the number o vertex N equals to 15 and that a constellation should never contain a self-loop edge, choose the correct alternative. (I) If Orion's belt is removed (the three star in a row at the bottom of the image), then we have a bipartite graph. (II) The sum of the values of the inverse diagonal of the adjacency matrix is always equal to or higher than the main diagonal in the costellations (III) A spaceship would travel among the constellation using each vertex N without repetition if Orion has lost his shield (IV) A spaceship would travel among the constellation using each edge E without repetition if Orion have lost his shield
Leia mais