Sciweavers

12 search results - page 1 / 3
» Real Number Channel Assignments for Lattices
Sort
View
SIAMDM
2008
50views more  SIAMDM 2008»
13 years 4 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin
IPPS
2005
IEEE
13 years 10 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
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, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
SIAMDM
2008
140views more  SIAMDM 2008»
13 years 4 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
IM
2007
13 years 4 months ago
Real Number Labelings for Paths and Cycles
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
Jerrold R. Griggs, Xiaohua Teresa Jin
JCO
2007
113views more  JCO 2007»
13 years 4 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin