1485 search results - page 35 / 297 » connection 2010 |
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
TMA
2010
Springer
13 years 7 months ago
2010
Springer
Spurious Retransmission Timeouts in TCP connections have been extensively studied in the scientific literature, particularly for their relevance in cellular mobile networks. At the...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Mobile social networks have been introduced as a new efficient (i.e., minimize resource usage) and effective (i.e., maximize the number of target recipients) way to disseminate con...