Timeline for what is the computational complexity of Louvain algorithm?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 29, 2021 at 18:13 | comment | added | rlchqrd | The paper cited in the Wikipedia article doesn't appear to actually state an $O(n\log(n))$ complexity for Louvain. They do claim without proof that it "is essentially linear in the number of links of the graph". Maybe I missed something? | |
| S Apr 26, 2021 at 19:33 | history | suggested | tinlyx | CC BY-SA 4.0 |
improved formatting
|
| Apr 26, 2021 at 18:24 | review | Suggested edits | |||
| S Apr 26, 2021 at 19:33 | |||||
| Dec 21, 2020 at 23:13 | comment | added | Matthieu Latapy | This $O(n\log(n))$ complexity is empirically observed on practical instance, but there is no proof, and I doubt non-trivial complexity is known. | |
| Dec 16, 2020 at 17:46 | comment | added | Luc Guyot | Apparently, it runs in time $O(n \log(n))$: en.wikipedia.org/wiki/Louvain_method. | |
| Dec 16, 2020 at 15:45 | review | First posts | |||
| Dec 17, 2020 at 7:40 | |||||
| Dec 16, 2020 at 15:41 | history | asked | AHQ | CC BY-SA 4.0 |