Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Louvain Method

Graph Algorithm

The Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks, created by Blondel and colleagues at the University of Louvain, the source of the method's name.

Facts
Time Complexity
Time Complexity (category)
Linearithmic Time -- O(n log n) 1
Classification
Design Technique
Greedy 1
Connections

In Field

Source Louvain method (Wikipedia)

Uses Design Technique

Sources
1. Louvain Method (Wikipedia)
https://en.wikipedia.org/wiki/Louvain_method
Quote, https://en.wikipedia.org/wiki/Louvain_method
The Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks created by Blondel et al.
Louvain method (Wikipedia)
  • In Field: Algorithms and Complexity Theory, Lead sentence
    Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks created by Blondel et al.
  • In Group: Community Detection and Link Analysis Algorithms, Lead section
    method for community detection
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.