Inkjet printing technology for printed microelectronics suffers from a number of non-idealities
due to unwanted ink flow on the substrate. This can be mitigated and pattern fidelity can be …

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 …

In many wireless networks, there is no fixed physical backbone nor centralized network
management. The nodes of such a network have to self-organize in order to maintain a …

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

Inkjet printing is an active domain of additive manufacturing and printed electronics due to its
promising features, starting from low-cost, scalability, non-contact printing, and microscale …

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 …

The graph decomposition problem consists of dividing a graph into components, patterns or
partitions which satisfy some specifications. In this paper, we give interest to graph …

The triangle partition problem is a generalization of the well-known graph matching problem
consisting of finding the maximum number of independent edges in a given graph, ie …