In this paper we propose a distributed algorithm for solving the positioning problem in ad-hoc wireless networks. The method is based on the capability of the nodes to measure the ...
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
- We present a new protocol for reliable data transfer in time-critical applications with zero tolerance for data loss in wireless sensor networks which uses less time and fewer me...
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...