Next Article in Journal
An Optimization Algorithm for the Design of an Irregularly-Shaped Bridge Based on the Orthogonal Test and Analytic Hierarchy Process
Next Article in Special Issue
Algorithms for Drug Sensitivity Prediction
Previous Article in Journal
Engineering a Combinatorial Laplacian Solver: Lessons Learned
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(4), 73; doi:10.3390/a9040073

Community Structure Detection for Directed Networks through Modularity Optimisation

Centre for Process Systems Engineering, Department of Chemical Engineering, University College London, London WC1E 7JE, UK
Department of Informatics, Faculty of Natural and Mathematical Sciences, King’s College London, London WC2R 2LS, UK
These authors contributed equally to this work.
Authors to whom correspondence should be addressed.
Academic Editors: Tatsuya Akutsu and Takeyuki Tamura
Received: 14 August 2016 / Revised: 5 October 2016 / Accepted: 18 October 2016 / Published: 1 November 2016
(This article belongs to the Special Issue Biological Networks)
View Full-Text   |   Download PDF [259 KB, uploaded 1 November 2016]   |  


Networks constitute powerful means of representing various types of complex systems, where nodes denote the system entities and edges express the interactions between the entities. An important topological property in complex networks is community structure, where the density of edges within subgraphs is much higher than across different subgraphs. Each of these subgraphs forms a community (or module). In literature, a metric called modularity is defined that measures the quality of a partition of nodes into different mutually exclusive communities. One means of deriving community structure is modularity maximisation. In this paper, a novel mathematical programming-based model, DiMod, is proposed that tackles the problem of maximising modularity for directed networks. View Full-Text
Keywords: community detection; directed networks; modularity optimisation; integer programming; complex networks community detection; directed networks; modularity optimisation; integer programming; complex networks

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Yang, L.; Silva, J.C.; Papageorgiou, L.G.; Tsoka, S. Community Structure Detection for Directed Networks through Modularity Optimisation. Algorithms 2016, 9, 73.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top