"RIV/00216208:11320/12:10131333!RIV13-GA0-11320___" . . "11320" . "Summer" . . . "algorithm; computational complexity; coloring; frequency assignment; graph"@en . "[00B46D4F9837]" . . "0302-9743" . "Determining the L(2, 1)-Span in Polynomial Space" . . "An L(2,1)-labeling of a graph is a mapping from its vertex set into a set of integers {0,..,k} such that adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal L(2,1)-labeling of a graph (i.e. an L(2,1)-labeling in which the largest label is the least possible) in time O *(7.4922^n ) and polynomial space. Moreover, a new interesting extremal graph theoretic problem is defined and solved." . . "130679" . "Determining the L(2, 1)-Span in Polynomial Space" . "DE - Spolkov\u00E1 republika N\u011Bmecko" . . "Determining the L(2, 1)-Span in Polynomial Space"@en . . "Determining the L(2, 1)-Span in Polynomial Space"@en . "Liedloff, Mathieu" . . . . "An L(2,1)-labeling of a graph is a mapping from its vertex set into a set of integers {0,..,k} such that adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal L(2,1)-labeling of a graph (i.e. an L(2,1)-labeling in which the largest label is the least possible) in time O *(7.4922^n ) and polynomial space. Moreover, a new interesting extremal graph theoretic problem is defined and solved."@en . "12"^^ . . "Junosza-Szaniawski, Konstanty" . "I, P(GBP202/12/G061)" . "7551" . "4"^^ . . . "Lecture Notes in Computer Science" . . "10.1007/978-3-642-34611-8_15" . "Kratochv\u00EDl, Jan" . . "RIV/00216208:11320/12:10131333" . . . "1"^^ . . "Rzazewski, Pawel" .