Inproceedings,

L(2, 1, 1)-Labeling Is NP-Complete for Trees.

, , and .
TAMC, volume 6108 of Lecture Notes in Computer Science, page 211-221. Springer, (2010)

Meta data

Tags

Users

  • @dblp

Comments and Reviews