11381 search results - page 76 / 2277 » Connectivity |
DCOSS
2009
Springer
15 years 2 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)...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
MMB
1999
Springer
15 years 2 months ago
1999
Springer
Auctions are a widely used approach for determining the current market price for congested resources. However, using them for real systems, such as the Internet, the auction algor...
CAIP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The visual systems in primates are organized around orienith a rich set of long-range horizontal connections. We abstract this from a differential-geometric perspective, ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...