CODEWITHSUNDEEP
pythoncluster-analysisnetworkxgraph-theorynetwork-analysis
AHQ
AHQ

Reputation: 33

looking for non-overlapping community detection algorithm with lower time complexity

I am trying to find community in a simple undirected network. I am looking for algorithm as well as code with lower time complexity than Clauset-Newman-Moore(CNM) algorithm. I tried to search but I couldn't find, please guide me here.

Upvotes: 1

Views: 247

Answers (1)

Pallie
Pallie

Reputation: 1109

Try the Leiden algorithm, it's a faster implementation of the Louvain algorithm with a smaller chance of returning poorly connected/disconnected communities.

Upvotes: 1

Related Questions