We introduce a method for assessing the robustness of community detection and apply it to
a world input-output network (WION) to obtain economically plausible results. This method …

In computer networks area, the minimal dominating sets (MDS) and maximal independent
sets (MIS) structures are very useful for creating virtual network overlays. Often, these set …

This design is mainly composed of RS485 communication network systems, host control
systems and slave control system. The RS485 communication network system is mainly to …

A p-star is a complete bipartite graph K 1, p with one center node and p leaves. In this paper,
we propose a polynomial self-stabilizing algorithm for maximal graph decomposition into p …

The book Graph Theory and Decomposition covers major areas of the decomposition of
graphs. It is a three-part reference book with nine chapters that is aimed at enthusiasts as …

We present a silent self-stabilizing distributed algorithm computing a maximal-star
decomposition of the underlying communication network. Under the unfair distributed …

The concept of self-stabilization was first introduced by Dijkstra in 1973. A distributed system
is self-stabilizing if it can start from any possible configuration and converges to a desired …

We present a silent self-stabilizing distributed algorithm computing a maximal p-star
decomposition of the underlying communication network. Under the unfair distributed …

In order to solve a problem, a usual approach is to represent it in a simple structure and
bring it to some particular cases. In graph theory, this approach is used to illustrate this …

Online social networks (OSNs) have become the most popular Internet application that
attracts billions of users to share information, disseminate opinions and interact with others …