Student at USF’s Data Science program. Trying to learn DS and share it to the world.

Jun 23 · 4 min

Clustering in a network is a challenging problem. If we would like to find what are the two distinct communities in a given graph, we would like to find the two sets of nodes in a graph such that the edges between these two groups are minimum and that’s where Karger’s Algorithm helps us. This…

6