Sciweavers

7380 search results - page 376 / 1476
» time 2008
Sort
View
JCP
2008
201views more  JCP 2008»
15 years 6 months ago
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks
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 ...
Gabriele Di Stefano, Alberto Petricola
156
Voted
JGT
2008
107views more  JGT 2008»
15 years 6 months ago
On planar intersection graphs with forbidden subgraphs
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 ...
János Pach, Micha Sharir
JNW
2008
123views more  JNW 2008»
15 years 6 months ago
An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks
- 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...
Damayanti Datta, Sukhamay Kundu
DAM
2007
105views more  DAM 2007»
15 years 6 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
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 ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
189
Voted
DAM
2007
82views more  DAM 2007»
15 years 6 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
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...
Baogang Xu, Haihui Zhang