We consider the following vertex-partition problem on graphs: given a graph with real nonnegative edge weights, partition the vertices into clusters (i.e. cliques) to minimize the total weight of edges out of the clusters. This optimization problem is known to be an NP-complete problem even for unweighted graphs and has been studied extensively in the scope of fixed-parameter tractability (FPT)...

An analysis is conducted on the robustness of measures of centrality in the face of random error in the network data. We use random networks of varying sizes and densities and subject them (separately) to four kinds of random error in varying amounts. The types of error are edge deletion, node deletion, edge addition, and node addition. The results show that the accuracy of centrality measures ...