MathJax


Saturday, June 3, 2023

2023-225

Agglomerative hierarchical clustering can be applied to community detection in graphs. By using dendrograms, one can visualize the order in which nodes merged. This visualization enables the extraction of the underlying community organization.

Which of the presented dendrograms and respective cuts would faithfully represent the given graph and its three colored communities?
  1. IV;
  2. III;
  3. II;
  4. I;
  5. None of the above.
Original idea by: Fillipi Valadares

No comments:

Post a Comment

2025-261

Consider a directed graph \(G\)   and the Kosaraju-Sharir's algorithm for finding strongly connected components (SCCs). Analyze the foll...