A Linear Time Algorithm for L(2,1)-Labeling of Trees

Author： Hasunuma Toru   Ishii Toshimasa   Ono Hirotaka   Uno Yushi  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.66, Iss.3, 2013-07, pp. : 654-681

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Exact Algorithms for L(2,1)-Labeling of Graphs

By Havet Frédéric   Klazar Martin   Kratochvíl Jan   Kratsch Dieter   Liedloff Mathieu  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 169-194

Springer Publishing Company

Access to resources Recommend Favorite

A Class of Inverse Dominant Problems under Weighted l∞ Norm and an Improved Complexity Bound for Radzik’s Algorithm

By Wang Qin   Yang Xiaoguang   Zhang Jianzhong  

Journal of Global Optimization, Vol. 34, Iss. 4, 2006-04 ,pp. : 551-567

Springer Publishing Company

Access to resources Recommend Favorite

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l ∞-Fitting Robinson Structures to Distances

By Chepoi Victor   Seston Morgan  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 521-568

Springer Publishing Company

Access to resources Recommend Favorite

L 1-Optimal Nonparametric Frontier Estimation via Linear Programming

By Girard S.   Iouditski A.   Nazin A.  

Automation and Remote Control, Vol. 66, Iss. 12, 2005-12 ,pp. : 2000-2018

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Robust polynomial classifier using L 1-norm minimization

By Assaleh K.   Shanableh T.  

Applied Intelligence, Vol. 33, Iss. 3, 2010-12 ,pp. : 330-339

Springer Publishing Company

Access to resources Recommend Favorite