1664 search results - page 237 / 333 » Distance labeling in graphs |
140
click to vote
DCOSS
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
126
click to vote
DM
2008
15 years 4 months ago
2008
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
116
click to vote
ALGOSENSORS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
156
click to vote
NETWORKS
2010
15 years 2 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
171
click to vote
CP
2011
Springer
14 years 4 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...