632 search results - page 87 / 127 » On Routing in Circulant Graphs |
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
APWEB
2006
Springer
14 years 7 days ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...