ComSim : A bipartite community detection algorithm using cycle and node's similarity

The information that we recorded is the percentage of runs that terminated, the number of active nodes and the average ratio between label list length and node degree.. Figure 4

In this paper, a novel community detection method based on particle swarm optimization (PSO) algorithm named PSO-Net has been proposed. In our method, the

This algorithm chooses the maximal relative centrality as the initial community, which solves the problem of inconsistent results of the community discovery algorithm based on

Concerning the approximability of related problems, Hassin and Rubinstein, [9] pro- posed a generic algorithm to approximate MaxW P 4 Packing in complete graphs on 4n vertices

That is, multiplication by an integer constant to all the weight of edges of a weighted bipartite graph G does not affect the time complexity of the modified decomposition algorithm

This paper is organized as follows: in the next section, we will briefly present previous related work about the hardness of solving bounded-size-path packing problems; then, the

Keywords: community, daily life, people’s movement, poor neighborhoods, social protest, South Africa... South Africa has, since the late 1990s, witnessed an almost

A mobile is a plane tree (i.e., a planar map with one face) with vertices either black or white, with dangling half-edges —called buds— at black vertices, such that there is