Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks

Abstract

For any non negative real values h and k, an L(h, k)-labeling of a graph G = (V,E) is a function L : V → IR such that |L(u)− L(v)| ≥ h if (u, v) ∈ E and |L(u)− L(v)| ≥ k if there exists w ∈ V such that (u,w) ∈ E and (w, v) ∈ E. The span of an L(h, k)-labeling is the difference between the largest and the smallest value of L, so it is not restrictive to… (More)
DOI: 10.1007/978-3-540-45208-9_14

Topics

1 Figure or Table

Cite this paper

@inproceedings{Calamoneri2003ExactSO, title={Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks}, author={Tiziana Calamoneri}, booktitle={ICTCS}, year={2003} }