Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...