205 search results - page 18 / 41 » Grid Graph Reachability Problems |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
TPDS
2008
13 years 9 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
SSDBM
2010
IEEE
13 years 8 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...