11381 search results - page 372 / 2277 » Connectivity |
153
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
177
click to vote
IPCO
2010
15 years 8 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
196
click to vote
NETWORKING
2007
15 years 8 months ago
2007
While current on-demand routing protocols are optimized to take into account unique features of mobile ad hoc networks (MANETs) such as frequent topology changes and limited batter...
272
click to vote
ACID
2006
15 years 8 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
211
click to vote
CIC
2006
15 years 8 months ago
2006
Abstract-- Topology control is the problem of assigning power levels to the nodes of an ad hoc network so as to maintain a specified network topology while minimizing energy consum...