174 search results - page 25 / 35 » Connected dominating sets on dynamic geometric graphs |
176
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
178
click to vote
ICCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
201
click to vote
ICC
2009
IEEE
15 years 3 months ago
2009
IEEE
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
193
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
130
click to vote
AML
2005
15 years 6 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...