251 search results - page 22 / 51 » Distributed algorithms for edge dominating sets |
121
click to vote
BROADNETS
2005
IEEE
15 years 3 months ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
QUESTA
2007
14 years 9 months ago
2007
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
DAM
2010
14 years 7 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...