3131 search results - page 189 / 627 » Generalized connection caching |
100
Voted
IPCO
2010
15 years 2 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...
201
click to vote
ACID
2006
15 years 2 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...
119
Voted
CIC
2006
15 years 2 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...
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
109
Voted
JGT
2006
15 years 23 days ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...