423 search results - page 71 / 85 » Topology for Distributed Inference on Graphs |
122
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
103
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
107
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...