Abstract
An L(2, 1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of nonnegative integers such that |f(x) − f(y)| ≥ 2 if x and y are adjacent and |f(x) − f(y)| ≥ 1 if x and y are at distance two for all x and y in V(G). The span of an L(2,1)-labeling f is the maximum value of f(x) over all vertices x of G. The L(2,1)-labeling number of a graph G, denoted as λ(G), is the least integer k such that G has an L(2,1)-labeling with span k.
Since the decision version of the L(2,1)-labeling problem is NP-complete, it is important to investigate heuristic approaches. In this paper, we first implement some heuristic algorithms and then perform an analysis of the obtained results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, A., Buyya, R., Nath, B.: Nature’s heuristics for scheduling jobs on computational grids. In: 8th IEEE International Conference on Advanced Computing and Communications, Cochin, India, pp. 45–52 (2000)
Ahuactzin, J.M., Talbi, E.-G., Bessiere, P., Mazer, E.: Using genetic algorithms for robot motion planning. In: Selected Papers from the Workshop on Geometric Reasoning for Perception and Action, London, pp. 84–93. Springer, Heidelberg (1993)
Calamoneri, T.: The L(h, k)-labelling problem: a survey and annotated bibliography. Comput. J. 49(5), 585–608 (2006)
Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discret. Math. 9(2), 309–316 (1996)
Garey, M.R., Johnson, D.S.: Computers and intractibility. W. H. Freeman and Co. Ltd., New York (1979)
Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)
Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discret. Math. 5(4), 586–595 (1992)
Hale, W.K.: Frequency assignment: theory and applications. Proceedings of the IEEE 68, 1497–1514 (1980)
Holladay, K.L., Robbins, K.A.: Evolution of signal processing algorithms using vector based genetic programming. In: 15th International Conference on Digital Signal Processing, pp. 503–506. IEEE, Los Alamitos (2007)
Holland, J.H.: Adaptation in natural and artificial systems. MIT Press, Cambridge (1992)
Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417–427 (1983)
Sakai, D.: Labeling chordal graphs: distance two condition. SIAM J. Discret. Math. 7(1), 133–140 (1994)
Sakuma, J., Kobayashi, S.: A genetic algorithm for privacy preserving combinatorial optimization. In: GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 1372–1379. ACM, New York (2007)
White, M.S., Flockton, S.J.: Genetic algorithms for digital signal processing. In: Fogarty, T.C. (ed.) AISB-WS 1994. LNCS, vol. 865, pp. 291–303. Springer, Heidelberg (1994)
Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discrete Math 306(12), 1217–1231 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panda, B.S., Goel, P. (2010). Heuristic Algorithms for the L(2,1)-Labeling Problem. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2010. Lecture Notes in Computer Science, vol 6466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17563-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-17563-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17562-6
Online ISBN: 978-3-642-17563-3
eBook Packages: Computer ScienceComputer Science (R0)