1629 search results - page 47 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ICRA
1999
IEEE
15 years 2 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
AINA
2008
IEEE
14 years 11 months ago
2008
IEEE
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as a core task of mining sensor data plays an essential role in analytical application...
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
114
click to vote
ICN
2005
Springer
15 years 3 months ago
2005
Springer
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...