2354 search results - page 101 / 471 » Radio number for trees |
180
click to vote
IANDC
2008
15 years 6 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
214
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
130
click to vote
ACL
1992
15 years 7 months ago
1992
We present a new compositional tense-aspect deindexing mechanism that makes use of tense trees as components of discourse contexts. The mechanism allows reference episodes to be c...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
155
click to vote
JCT
2008
15 years 6 months ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...