2365 search results - page 21 / 473 » All things are connected |
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
117
click to vote
MWCN
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
DM
2000
15 years 1 months ago
2000
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
129
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
SPAA
2000
ACM
15 years 4 months ago
2000
ACM
Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment...