92 search results - page 18 / 19 » Bottleneck Domination and Bottleneck Independent Domination ... |
INFOCOM
2003
IEEE
14 years 22 days ago
2003
IEEE
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
TSP
2010
13 years 2 months ago
2010
Graphical models are a framework for representing and exploiting prior conditional independence structures within distributions using graphs. In the Gaussian case, these models are...
WDAG
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...