117 search results - page 20 / 24 » Graphs with Chromatic Roots in the Interval (1, 2) |
STOC
2010
ACM
14 years 7 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
IJMC
2006
13 years 7 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
PE
2002
Springer
13 years 7 months ago
2002
Springer
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
DSN
2002
IEEE
14 years 10 days ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...