We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
We studied the evolution of an online innovation community and users’ interaction behavior through social network analysis to explore how to build an innovation community and ge...
—Wireless Community Networks (WCNs) are wide-area wireless networks whose nodes are owned and managed by volunteers. We focus on the provision of Internet access to mobile users ...
Elias C. Efstathiou, Pantelis A. Frangoudis, Georg...