A General Approach to L(h,k)-Label Interconnection Networks
- 28 Downloads
Given two non-negative integers h and k, an L(h, k)-labeling of a graph G = (V, E) is a function from the set V to a set of colors, such that adjacent nodes take colors at distance at least h, and nodes at distance 2 take colors at distance at least k. The aim of the L(h, k)-labeling problem is to minimize the greatest used color. Since the decisional version of this problem is NP-complete, it is important to investigate particular classes of graphs for which the problem can be efficiently solved. It is well known that the most common interconnection topologies, such as Butterfly-like, Bene·s, CCC, Trivalent Cayley networks, are all characterized by a similar structure: they have nodes organized as a matrix and connections are divided into layers. So we naturally introduce a new class of graphs, called (l × n)-multistage graphs, containing the most common interconnection topologies, on which we study the L(h, k)-labeling. A general algorithm for L(h, k)-labeling these graphs is presented, and from this method an efficient L(2, 1)-labeling for Butterfly and CCC networks is derived. Finally we describe a possible generalization of our approach.
Keywordsmultistage interconnection network L(h, k)-labeling channel assignment problem
Unable to display preview. Download preview PDF.
- Roberts F S. From Garbage to Rainbows: Generalizations of Graph Coloring and Their Applications. Graph Theory, Combinatorics, and Applications, 2, Alavi Y, Chartrand G, Oellermann O R, Schwenk A J (eds.), 2, New York: Wiley, 1991, pp.1031–1052.Google Scholar
- K I Aardal, S P M van Hoesel, A M C A Koster, C Mannino, A Sassano. Models and solution techniques for frequency assignment problems. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 2001.Google Scholar
- H L Bodlaender, T Kloks, R B Tan, J van Leeuwen. Lambda coloring of graphs. In Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lille, France, LNCS 1770, Feb. 2000, pp.395–406.Google Scholar
- Fiala J, Kloks T, Kratochvíl J. Fixed-parameter complexity of λ-colorings. In Proc. Graph Theoretic Concepts in Computer Science (WG’99), LNCS 1665, 1999, pp.350–363.Google Scholar
- Murphey R A, Pardalos P M, Resende M G C. Frequency Assignment Problems. Handbook of Combinatorial Optimization, Du D-Z, Pardalos P M (eds.), Kluwer Academic Publishers, 1999, pp.295–377.Google Scholar
- Shepherd M. Radio channel assignment [Dissertation]. Merton College, Oxford, 1998.Google Scholar
- Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.Google Scholar