3008 search results - page 300 / 602 » Independence in connected graphs |
175
click to vote
ICALP
2004
Springer
16 years 3 days ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
219
click to vote
FSTTCS
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
204
click to vote
ACMSE
2007
ACM
15 years 10 months ago
2007
ACM
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
199
click to vote
DIALM
2003
ACM
15 years 12 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...