142 search results - page 23 / 29 » On the Independent Domination Number of Random Regular Graph... |
DCG
2006
13 years 7 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
SODA
2004
ACM
13 years 9 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...
ALGOSENSORS
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
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...