2354 search results - page 39 / 471 » Radio number for trees |
TCOM
2010
14 years 8 months ago
2010
Abstract— In this paper, we study the coexistence and optimization of a multicell cognitive radio network (CRN) which is overlaid with a multicell primary radio network (PRN). We...
159
click to vote
GC
2011
Springer
14 years 4 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
COMBINATORICS
2006
14 years 9 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...