Given any fixed non-negative integer values h and k, the L(h, k)-labelling problem consists in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes receive values which differ by at least h, and nodes connected by a 2 length path receive values which differ by at least k. The span of an L(h, k)-labelling is the difference between the largest and the smallest assigned frequency. The goal of the problem is to find out an L(h, k)-labelling with minimum span. The L(h, k)-labelling problem has been intensively studied following many approaches and restricted to many special cases, concerning both the values of h and k and the considered classes of graphs. This paper reviews the results from previous by published literature, looking at the problem with a graph algorithmic approach. © 2006 Oxford University Press.
The L(h, k)-labelling problem: A survey and annotated bibliography / Calamoneri, Tiziana. - In: COMPUTER JOURNAL. - ISSN 0010-4620. - STAMPA. - 49:5(2006), pp. 585-608. [10.1093/comjnl/bxl018]
The L(h, k)-labelling problem: A survey and annotated bibliography
CALAMONERI, Tiziana
2006
Abstract
Given any fixed non-negative integer values h and k, the L(h, k)-labelling problem consists in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes receive values which differ by at least h, and nodes connected by a 2 length path receive values which differ by at least k. The span of an L(h, k)-labelling is the difference between the largest and the smallest assigned frequency. The goal of the problem is to find out an L(h, k)-labelling with minimum span. The L(h, k)-labelling problem has been intensively studied following many approaches and restricted to many special cases, concerning both the values of h and k and the considered classes of graphs. This paper reviews the results from previous by published literature, looking at the problem with a graph algorithmic approach. © 2006 Oxford University Press.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.