3131 search results - page 206 / 627 » Generalized connection caching |
158
click to vote
ENDM
2010
15 years 5 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
142
click to vote
DM
2008
15 years 5 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
143
click to vote
IM
2008
15 years 5 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
124
click to vote
IPL
2007
15 years 5 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
153
Voted
TIT
2008
15 years 5 months ago
2008
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...