Recent advances on distance constrained labeling problems

Hirotaka Ono

doi:10.1109/CANDAR.2013.13

Recent advances on distance constrained labeling problems

Hirotaka Ono

mathematics and information

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013
Pages	26-29
Number of pages	4
DOIs	https://doi.org/10.1109/CANDAR.2013.13
Publication status	Published - 2013
Event	2013 1st International Symposium on Computing and Networking, CANDAR 2013 - Matsuyama, Ehime, Japan Duration: Dec 4 2013 → Dec 6 2013

Other

Other	2013 1st International Symposium on Computing and Networking, CANDAR 2013
Country/Territory	Japan
City	Matsuyama, Ehime
Period	12/4/13 → 12/6/13

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Access to Document

10.1109/CANDAR.2013.13

Cite this

@inproceedings{ea2817b57520460aac31a5ce38b07d91,

title = "Recent advances on distance constrained labeling problems",

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.",

author = "Hirotaka Ono",

year = "2013",

doi = "10.1109/CANDAR.2013.13",

language = "English",

isbn = "9781479927951",

pages = "26--29",

booktitle = "Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013",

note = "2013 1st International Symposium on Computing and Networking, CANDAR 2013 ; Conference date: 04-12-2013 Through 06-12-2013",

}

TY - GEN

T1 - Recent advances on distance constrained labeling problems

AU - Ono, Hirotaka

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84894217660&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894217660&partnerID=8YFLogxK

U2 - 10.1109/CANDAR.2013.13

DO - 10.1109/CANDAR.2013.13

M3 - Conference contribution

AN - SCOPUS:84894217660

SN - 9781479927951

SP - 26

EP - 29

BT - Proceedings - 2013 1st International Symposium on Computing and Networking, CANDAR 2013

T2 - 2013 1st International Symposium on Computing and Networking, CANDAR 2013

Y2 - 4 December 2013 through 6 December 2013

ER -

Recent advances on distance constrained labeling problems

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this