This blog aims to publish the quiz questions of the discipline MO412 (Graph Algorithms) presented by Prof Meidanis in the Graduate Program in Computer Science of the Institute of Computing of the University of Campinas (Unicamp).
2022-012
To uncover the community structure of networks, we can use hierarchical clustering algorithms, and dendrograms help us to extract the underlying community organization. Analyze the figure below, observing the colored lines (A, B, and C) that cut the dendrogram to define communities.
Select the correct alternative:
Original idea by: Rubens de Castro Pereira
Interesting question, but does not explore something significantly different from what we already have in the blog.
2022-013 Consider the graph below and the flow from 1 to 10, where the capacity value is defined in each link. Select the correct alternativ...
Interesting question, but does not explore something significantly different from what we already have in the blog.
ReplyDelete