Abstract
L(2,1)-labeling is graph labeling model where adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. In this paper we present an algorithm for finding an optimal L(2,1)-labeling (i.e. an L(2,1)-labeling in which largest label is the least possible) of a graph with time complexity O* (3.5616n), which improves a previous best result: O* (3.8739n). © 2011 Springer-Verlag.
Cite
CITATION STYLE
Junosza-Szaniawski, K., & Rza̧zewski, P. (2011). On improved exact algorithms for L(2,1)-labeling of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6460 LNCS, pp. 34–37). https://doi.org/10.1007/978-3-642-19222-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
