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

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

Publisher： Springer Publishing Company

ISSN： 0178-4617

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

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

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

By Hasunuma Toru   Ishii Toshimasa   Ono Hirotaka   Uno Yushi  

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

Springer Publishing Company

Access to resources Recommend Favorite

Exact asymptotics of large deviations of stationary Ornstein-Uhlenbeck processes for L p-functionals, p > 0

By Fatalov V.  

Problems of Information Transmission, Vol. 42, Iss. 1, 2006-03 ,pp. : 46-63

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

Robust D-decomposition under l p-bounded parametric uncertainties

By Tremba A.  

Automation and Remote Control, Vol. 67, Iss. 12, 2006-12 ,pp. : 1878-1892

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems

By Guillemot Sylvain   Havet Frédéric   Paul Christophe   Perez Anthony  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 900-926

Springer Publishing Company

Access to resources Recommend Favorite