On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
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.5616 n ), which improves a previous best result: O * ( 3.8739 n ).
Unable to display preview. Download preview PDF.
- 2.Havet, F., Klazar, M., Kratochvíl, J., Kratsch, D., Liedloff, M.: Exact Algorithms for L(2,1)-Labeling of Graphs. Algorithmica, doi: 10.1007/s00453-009-9302-7Google Scholar