Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

L(2,1,1)-labeling is NP-complete for trees.

Golovach, P.A. and Lidicky, B. and Paulusma, Daniel (2010) 'L(2,1,1)-labeling is NP-complete for trees.', in Theory and applications of mdels of computation, 7th Annual Conference, TAMC 2010, 7-11 June 2010, Prague, Czech Republic ; proceedings. Berlin ; Heidelburg: Springer, pp. 211-221. Lecture notes in computer science. (6108).

Abstract

An L(p 1,p 2,p 3)-labeling of a graph G with span λ is a mapping f that assigns each vertex u of G an integer label 0 ≤ f(u) ≤ λ such that |f(u) − f(v)| ≥ p i whenever vertices u and v are of distance i for i ∈ {1,2,3}. We show that testing whether a given graph has an L(2,1,1)-labeling with some given span λ is NP-complete even for the class of trees.

Item Type:Book chapter
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1007/978-3-642-13562-0_20
Record Created:07 Oct 2010 12:05
Last Modified:03 Apr 2013 13:20

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library