Document Type

Contribution to a Book

Publication Date


Publication Title

Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2018


Yann Disser, Vassilios S. Verykios

First Page


Last Page





Most social networks of today are populated with several millions of active users, while the most popular of them accommodate way more than one billion. Analyzing such huge complex networks has become particularly demanding in computational terms. A task of paramount importance for understanding the structure of social networks as well as of many other real-world systems is to identify communities, that is, sets of nodes that are more densely connected to each other than to other nodes of the network. In this paper we propose two algorithms for community detection in networks, by employing the neighborhood overlap metric and appropriate spanning tree computations.


This is a post-peer-review, pre-copyedit version of an article published in Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2018. The final authenticated version is available online at:

SJSU users: Use the following link to login and access the article via SJSU databases.