The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...