Recent advances on distance constrained labeling problems

Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Distance constrained labeling problems, e.g., L(p, q)-labeling and (p, q)-total labeling, are originally motivated by the frequency assignment. From the viewpoint of theory, the upper bounds on the labeling numbers and the time complexity of finding a minimum labeling are intensively and extensively studied. In this paper, we survey the recent advances of the distance constrained labeling problems.

Original languageEnglish
Title of host publicationProceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013
Pages26-29
Number of pages4
DOIs
Publication statusPublished - 2013
Event2013 1st International Symposium on Computing and Networking, CANDAR 2013 - Matsuyama, Ehime, Japan
Duration: Dec 4 2013Dec 6 2013

Other

Other2013 1st International Symposium on Computing and Networking, CANDAR 2013
CountryJapan
CityMatsuyama, Ehime
Period12/4/1312/6/13

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Ono, H. (2013). Recent advances on distance constrained labeling problems. In Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013 (pp. 26-29). [6726875] https://doi.org/10.1109/CANDAR.2013.13