Constant Communities in Complex Networks

Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to th...

Descripción completa

Detalles Bibliográficos
Autores principales: Chakraborty, Tanmoy, Srinivasan, Sriram, Ganguly, Niloy, Bhowmick, Sanjukta, Mukherjee, Animesh
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2013
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6504828/
https://www.ncbi.nlm.nih.gov/pubmed/23661107
http://dx.doi.org/10.1038/srep01825

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6504828/
https://www.ncbi.nlm.nih.gov/pubmed/23661107
http://dx.doi.org/10.1038/srep01825

Ejemplares similares