In the k-labeled Spanning Forest Problem (kLSF), given a graph G with a label (color) assigned to each edge, and an integer positive value kmax we look for the minimum number of connected components that can be obtained by using at most kmax different labels. The problem is strictly related to the Minimum Labelling Spanning Tree Problem (MLST), since a spanning tree of the graph (i.e. a single connected component) would obviously be an optimal solution for the kLSF, if it can be obtained without violating the bound on kmax.

We aim to maximize the operational time of a network of sensors, which are used to monitor a predefined set of target locations. The classical approach proposed in the literature consists in individuating subsets of sensors (covers) that can individually monitor the targets, and in assigning appropriate activation times to each cover. Indeed, since sensors may belong to multiple covers, it is important to make sure that their overall battery capacities are not violated.

In this article, we face the problem of ensuring reliability of a wireless sensor network which is monitoring a given set of points of interest while maximizing its lifetime (i.e., the amount of time over which the monitoring activity can be performed). The two objectives are contrasting. Indeed, the traditional approach to achieve reliability involves providing redundant coverage, which, however, drastically reduces the network lifetime. We propose an alternative strategy where sensors adapt their sensing radii in response to failures to restore feasibility only when needed.

Image resizing is a basic tool in image processing, and in literature, we have many methods based on different approaches, which are often specialized in only upscaling or downscaling. In this paper, independently of the (reduced or enlarged) size we aim to get, we approach the problem at a continuous scale where the underlying function representing the image is globally approximated by its Lagrange-Chebyshev I kind interpolation polynomial corresponding to suitable (tensor product) grids of first kind Chebyshev zeros.

The dynamic behavior of a self-propelled semiflexible filament of length L is considered under the action of an external unbounded shear flow. The system is studied by using Brownian multi-particle collision dynamics. The system can be characterized in terms of the persistence length Lp of the chain, of the Peclet number, and of the Weissenberg number.

We present a new method for assessing and measuring homophily in networks whose nodes have categorical attributes, namely when the nodes of networks come partitioned into classes (colors).

We study numerically the role of hydrodynamics in the liquid-hexatic transition of active colloids at intermediate activity, where motility induced phase separation (MIPS) does not occur. We show that in the case of active Brownian particles (ABP), the critical density of the transition decreases upon increasing the particle's mass, enhancing ordering, while self-propulsion has the opposite effect in the activity regime considered.

The dynamic behavior of a self-propelled semiflexible filament of length L is con- sidered under the action of a linear shear flow. The system is studied by using Brownian multi-particle collision dynamics. The system can be characterized in terms of the persistence length Lp of the chain, of the Peclet number, and of the Weissenberg number. The quantity Lp/L measures the bending rigidity of the polymer, the Peclet number Pe is the ratio of active force times L to thermal energy, and the Weissenberg number Wi characterizes the flow strength over thermal effects.