1732 search results - page 41 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
166
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
154
click to vote
JGT
2007
15 years 6 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
167
click to vote
FOCS
2006
IEEE
16 years 6 days ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
180
click to vote
EJC
2006
15 years 6 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
140
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....