Mixing network extremal optimization for community structure detection

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mixing Network Extremal Optimization is a new algorithm designed to identify the community structure in networks by using a game theoretic approach and a network mixing mechanism as a diversity preserving method. Numerical experiments performed on synthetic and real networks illustrate the potential of the approach.

Cite

CITATION STYLE

APA

Suciu, M., Lung, R. I., & Gaskó, N. (2015). Mixing network extremal optimization for community structure detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9026, pp. 126–137). Springer Verlag. https://doi.org/10.1007/978-3-319-16468-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free